Coverage Report

Created: 2018-08-14 02:14

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/polly/lib/External/isl/isl_pw_union_opt.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2011      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, INRIA Saclay - Ile-de-France,
8
 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
9
 * 91893 Orsay, France
10
 * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France
11
 */
12
13
#include <isl_pw_macro.h>
14
15
/* Given a function "cmp" that returns the set of elements where
16
 * "el1" is "better" than "el2", return this set.
17
 */
18
static __isl_give isl_set *FN(PW,better)(__isl_keep EL *el1, __isl_keep EL *el2,
19
  __isl_give isl_set *(*cmp)(__isl_take EL *el1, __isl_take EL *el2))
20
1.64k
{
21
1.64k
  return cmp(FN(EL,copy)(el1), FN(EL,copy)(el2));
22
1.64k
}
isl_aff.c:isl_pw_aff_better
Line
Count
Source
20
374
{
21
374
  return cmp(FN(EL,copy)(el1), FN(EL,copy)(el2));
22
374
}
isl_aff.c:isl_pw_multi_aff_better
Line
Count
Source
20
1.27k
{
21
1.27k
  return cmp(FN(EL,copy)(el1), FN(EL,copy)(el2));
22
1.27k
}
23
24
/* Return a list containing the domains of the pieces of "pw".
25
 */
26
static __isl_give isl_set_list *FN(PW,extract_domains)(__isl_keep PW *pw)
27
3.36k
{
28
3.36k
  int i;
29
3.36k
  isl_ctx *ctx;
30
3.36k
  isl_set_list *list;
31
3.36k
32
3.36k
  if (!pw)
33
0
    return NULL;
34
3.36k
  ctx = FN(PW,get_ctx)(pw);
35
3.36k
  list = isl_set_list_alloc(ctx, pw->n);
36
9.76k
  for (i = 0; i < pw->n; 
++i6.40k
)
37
6.40k
    list = isl_set_list_add(list, isl_set_copy(pw->p[i].set));
38
3.36k
39
3.36k
  return list;
40
3.36k
}
isl_aff.c:isl_pw_aff_extract_domains
Line
Count
Source
27
730
{
28
730
  int i;
29
730
  isl_ctx *ctx;
30
730
  isl_set_list *list;
31
730
32
730
  if (!pw)
33
0
    return NULL;
34
730
  ctx = FN(PW,get_ctx)(pw);
35
730
  list = isl_set_list_alloc(ctx, pw->n);
36
1.50k
  for (i = 0; i < pw->n; 
++i772
)
37
772
    list = isl_set_list_add(list, isl_set_copy(pw->p[i].set));
38
730
39
730
  return list;
40
730
}
isl_aff.c:isl_pw_multi_aff_extract_domains
Line
Count
Source
27
2.63k
{
28
2.63k
  int i;
29
2.63k
  isl_ctx *ctx;
30
2.63k
  isl_set_list *list;
31
2.63k
32
2.63k
  if (!pw)
33
0
    return NULL;
34
2.63k
  ctx = FN(PW,get_ctx)(pw);
35
2.63k
  list = isl_set_list_alloc(ctx, pw->n);
36
8.26k
  for (i = 0; i < pw->n; 
++i5.62k
)
37
5.62k
    list = isl_set_list_add(list, isl_set_copy(pw->p[i].set));
38
2.63k
39
2.63k
  return list;
40
2.63k
}
41
42
/* Given sets B ("set"), C ("better") and A' ("out"), return
43
 *
44
 *  (B \cap C) \cup ((B \setminus C) \setminus A')
45
 */
46
static __isl_give isl_set *FN(PW,better_or_out)(__isl_take isl_set *set,
47
  __isl_take isl_set *better, __isl_take isl_set *out)
48
1.64k
{
49
1.64k
  isl_set *set_better, *set_out;
50
1.64k
51
1.64k
  set_better = isl_set_intersect(isl_set_copy(set), isl_set_copy(better));
52
1.64k
  set_out = isl_set_subtract(isl_set_subtract(set, better), out);
53
1.64k
54
1.64k
  return isl_set_union(set_better, set_out);
55
1.64k
}
isl_aff.c:isl_pw_aff_better_or_out
Line
Count
Source
48
374
{
49
374
  isl_set *set_better, *set_out;
50
374
51
374
  set_better = isl_set_intersect(isl_set_copy(set), isl_set_copy(better));
52
374
  set_out = isl_set_subtract(isl_set_subtract(set, better), out);
53
374
54
374
  return isl_set_union(set_better, set_out);
55
374
}
isl_aff.c:isl_pw_multi_aff_better_or_out
Line
Count
Source
48
1.27k
{
49
1.27k
  isl_set *set_better, *set_out;
50
1.27k
51
1.27k
  set_better = isl_set_intersect(isl_set_copy(set), isl_set_copy(better));
52
1.27k
  set_out = isl_set_subtract(isl_set_subtract(set, better), out);
53
1.27k
54
1.27k
  return isl_set_union(set_better, set_out);
55
1.27k
}
56
57
/* Given sets A ("set"), C ("better") and B' ("out"), return
58
 *
59
 *  (A \setminus C) \cup ((A \cap C) \setminus B')
60
 */
61
static __isl_give isl_set *FN(PW,worse_or_out)(__isl_take isl_set *set,
62
  __isl_take isl_set *better, __isl_take isl_set *out)
63
1.64k
{
64
1.64k
  isl_set *set_worse, *set_out;
65
1.64k
66
1.64k
  set_worse = isl_set_subtract(isl_set_copy(set), isl_set_copy(better));
67
1.64k
  set_out = isl_set_subtract(isl_set_intersect(set, better), out);
68
1.64k
69
1.64k
  return isl_set_union(set_worse, set_out);
70
1.64k
}
isl_aff.c:isl_pw_aff_worse_or_out
Line
Count
Source
63
374
{
64
374
  isl_set *set_worse, *set_out;
65
374
66
374
  set_worse = isl_set_subtract(isl_set_copy(set), isl_set_copy(better));
67
374
  set_out = isl_set_subtract(isl_set_intersect(set, better), out);
68
374
69
374
  return isl_set_union(set_worse, set_out);
70
374
}
isl_aff.c:isl_pw_multi_aff_worse_or_out
Line
Count
Source
63
1.27k
{
64
1.27k
  isl_set *set_worse, *set_out;
65
1.27k
66
1.27k
  set_worse = isl_set_subtract(isl_set_copy(set), isl_set_copy(better));
67
1.27k
  set_out = isl_set_subtract(isl_set_intersect(set, better), out);
68
1.27k
69
1.27k
  return isl_set_union(set_worse, set_out);
70
1.27k
}
71
72
/* Given two piecewise expressions "pw1" and "pw2", replace their domains
73
 * by the sets in "list1" and "list2" and combine the results into
74
 * a single piecewise expression.
75
 * The pieces of "pw1" and "pw2" are assumed to have been sorted
76
 * according to the function value expressions.
77
 * The pieces of the result are also sorted in this way.
78
 *
79
 * Run through the pieces of "pw1" and "pw2" in order until they
80
 * have both been exhausted, picking the piece from "pw1" or "pw2"
81
 * depending on which should come first, together with the corresponding
82
 * domain from "list1" or "list2".  In cases where the next pieces
83
 * in both "pw1" and "pw2" have the same function value expression,
84
 * construct only a single piece in the result with as domain
85
 * the union of the domains in "list1" and "list2".
86
 */
87
static __isl_give PW *FN(PW,merge)(__isl_take PW *pw1, __isl_take PW *pw2,
88
  __isl_take isl_set_list *list1, __isl_take isl_set_list *list2)
89
1.68k
{
90
1.68k
  int i, j;
91
1.68k
  PW *res;
92
1.68k
93
1.68k
  if (!pw1 || !pw2)
94
0
    goto error;
95
1.68k
96
1.68k
  res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->n + pw2->n);
97
1.68k
98
1.68k
  i = 0; j = 0;
99
7.55k
  while (i < pw1->n || 
j < pw2->n2.38k
) {
100
5.87k
    int cmp;
101
5.87k
    isl_set *set;
102
5.87k
    EL *el;
103
5.87k
104
5.87k
    if (i < pw1->n && 
j < pw2->n5.17k
)
105
3.47k
      cmp = FN(EL,plain_cmp)(pw1->p[i].FIELD,
106
3.47k
            pw2->p[j].FIELD);
107
2.39k
    else
108
2.39k
      cmp = i < pw1->n ? 
-11.69k
:
1701
;
109
5.87k
110
5.87k
    if (cmp < 0) {
111
4.08k
      set = isl_set_list_get_set(list1, i);
112
4.08k
      el = FN(EL,copy)(pw1->p[i].FIELD);
113
4.08k
      ++i;
114
4.08k
    } else 
if (1.78k
cmp > 01.78k
) {
115
1.25k
      set = isl_set_list_get_set(list2, j);
116
1.25k
      el = FN(EL,copy)(pw2->p[j].FIELD);
117
1.25k
      ++j;
118
1.25k
    } else {
119
529
      set = isl_set_union(isl_set_list_get_set(list1, i),
120
529
              isl_set_list_get_set(list2, j));
121
529
      el = FN(EL,copy)(pw1->p[i].FIELD);
122
529
      ++i;
123
529
      ++j;
124
529
    }
125
5.87k
    res = FN(PW,add_piece)(res, set, el);
126
5.87k
  }
127
1.68k
128
1.68k
  isl_set_list_free(list1);
129
1.68k
  isl_set_list_free(list2);
130
1.68k
  FN(PW,free)(pw1);
131
1.68k
  FN(PW,free)(pw2);
132
1.68k
  return res;
133
1.68k
error:
134
0
  isl_set_list_free(list1);
135
0
  isl_set_list_free(list2);
136
0
  FN(PW,free)(pw1);
137
0
  FN(PW,free)(pw2);
138
0
  return NULL;
139
1.68k
}
isl_aff.c:isl_pw_aff_merge
Line
Count
Source
89
365
{
90
365
  int i, j;
91
365
  PW *res;
92
365
93
365
  if (!pw1 || !pw2)
94
0
    goto error;
95
365
96
365
  res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->n + pw2->n);
97
365
98
365
  i = 0; j = 0;
99
1.12k
  while (i < pw1->n || 
j < pw2->n545
) {
100
756
    int cmp;
101
756
    isl_set *set;
102
756
    EL *el;
103
756
104
756
    if (i < pw1->n && 
j < pw2->n576
)
105
393
      cmp = FN(EL,plain_cmp)(pw1->p[i].FIELD,
106
393
            pw2->p[j].FIELD);
107
363
    else
108
363
      cmp = i < pw1->n ? 
-1183
:
1180
;
109
756
110
756
    if (cmp < 0) {
111
391
      set = isl_set_list_get_set(list1, i);
112
391
      el = FN(EL,copy)(pw1->p[i].FIELD);
113
391
      ++i;
114
391
    } else 
if (365
cmp > 0365
) {
115
349
      set = isl_set_list_get_set(list2, j);
116
349
      el = FN(EL,copy)(pw2->p[j].FIELD);
117
349
      ++j;
118
349
    } else {
119
16
      set = isl_set_union(isl_set_list_get_set(list1, i),
120
16
              isl_set_list_get_set(list2, j));
121
16
      el = FN(EL,copy)(pw1->p[i].FIELD);
122
16
      ++i;
123
16
      ++j;
124
16
    }
125
756
    res = FN(PW,add_piece)(res, set, el);
126
756
  }
127
365
128
365
  isl_set_list_free(list1);
129
365
  isl_set_list_free(list2);
130
365
  FN(PW,free)(pw1);
131
365
  FN(PW,free)(pw2);
132
365
  return res;
133
365
error:
134
0
  isl_set_list_free(list1);
135
0
  isl_set_list_free(list2);
136
0
  FN(PW,free)(pw1);
137
0
  FN(PW,free)(pw2);
138
0
  return NULL;
139
365
}
isl_aff.c:isl_pw_multi_aff_merge
Line
Count
Source
89
1.31k
{
90
1.31k
  int i, j;
91
1.31k
  PW *res;
92
1.31k
93
1.31k
  if (!pw1 || !pw2)
94
0
    goto error;
95
1.31k
96
1.31k
  res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->n + pw2->n);
97
1.31k
98
1.31k
  i = 0; j = 0;
99
6.43k
  while (i < pw1->n || 
j < pw2->n1.83k
) {
100
5.11k
    int cmp;
101
5.11k
    isl_set *set;
102
5.11k
    EL *el;
103
5.11k
104
5.11k
    if (i < pw1->n && 
j < pw2->n4.59k
)
105
3.08k
      cmp = FN(EL,plain_cmp)(pw1->p[i].FIELD,
106
3.08k
            pw2->p[j].FIELD);
107
2.03k
    else
108
2.03k
      cmp = i < pw1->n ? 
-11.50k
:
1521
;
109
5.11k
110
5.11k
    if (cmp < 0) {
111
3.69k
      set = isl_set_list_get_set(list1, i);
112
3.69k
      el = FN(EL,copy)(pw1->p[i].FIELD);
113
3.69k
      ++i;
114
3.69k
    } else 
if (1.42k
cmp > 01.42k
) {
115
909
      set = isl_set_list_get_set(list2, j);
116
909
      el = FN(EL,copy)(pw2->p[j].FIELD);
117
909
      ++j;
118
909
    } else {
119
513
      set = isl_set_union(isl_set_list_get_set(list1, i),
120
513
              isl_set_list_get_set(list2, j));
121
513
      el = FN(EL,copy)(pw1->p[i].FIELD);
122
513
      ++i;
123
513
      ++j;
124
513
    }
125
5.11k
    res = FN(PW,add_piece)(res, set, el);
126
5.11k
  }
127
1.31k
128
1.31k
  isl_set_list_free(list1);
129
1.31k
  isl_set_list_free(list2);
130
1.31k
  FN(PW,free)(pw1);
131
1.31k
  FN(PW,free)(pw2);
132
1.31k
  return res;
133
1.31k
error:
134
0
  isl_set_list_free(list1);
135
0
  isl_set_list_free(list2);
136
0
  FN(PW,free)(pw1);
137
0
  FN(PW,free)(pw2);
138
0
  return NULL;
139
1.31k
}
140
141
/* Given a function "cmp" that returns the set of elements where
142
 * "el1" is "better" than "el2", return a piecewise
143
 * expression defined on the union of the definition domains
144
 * of "pw1" and "pw2" that maps to the "best" of "pw1" and
145
 * "pw2" on each cell.  If only one of the two input functions
146
 * is defined on a given cell, then it is considered the best.
147
 *
148
 * Run through all pairs of pieces in "pw1" and "pw2".
149
 * If the domains of these pieces intersect, then the intersection
150
 * needs to be distributed over the two pieces based on "cmp".
151
 * Let C be the set where the piece from "pw2" is better (according to "cmp")
152
 * than the piece from "pw1".  Let A be the domain of the piece from "pw1" and
153
 * B the domain of the piece from "pw2".
154
 *
155
 * The elements in C need to be removed from A, except for those parts
156
 * that lie outside of B.  That is,
157
 *
158
 *  A <- (A \setminus C) \cup ((A \cap C) \setminus B')
159
 *
160
 * Conversely, the elements in B need to be restricted to C, except
161
 * for those parts that lie outside of A.  That is
162
 *
163
 *  B <- (B \cap C) \cup ((B \setminus C) \setminus A')
164
 *
165
 * Since all pairs of pieces are considered, the domains are updated
166
 * several times.  A and B refer to these updated domains
167
 * (kept track of in "list1" and "list2"), while A' and B' refer
168
 * to the original domains of the pieces.  It is safe to use these
169
 * original domains because the difference between, say, A' and A is
170
 * the domains of pw2-pieces that have been removed before and
171
 * those domains are disjoint from B.  A' is used instead of A
172
 * because the continued updating of A may result in this domain
173
 * getting broken up into more disjuncts.
174
 *
175
 * After the updated domains have been computed, the result is constructed
176
 * from "pw1", "pw2", "list1" and "list2".  If there are any pieces
177
 * in "pw1" and "pw2" with the same function value expression, then
178
 * they are combined into a single piece in the result.
179
 * In order to be able to do this efficiently, the pieces of "pw1" and
180
 * "pw2" are first sorted according to their function value expressions.
181
 */
182
static __isl_give PW *FN(PW,union_opt_cmp)(
183
  __isl_take PW *pw1, __isl_take PW *pw2,
184
  __isl_give isl_set *(*cmp)(__isl_take EL *el1, __isl_take EL *el2))
185
1.80k
{
186
1.80k
  int i, j;
187
1.80k
  PW *res = NULL;
188
1.80k
  isl_ctx *ctx;
189
1.80k
  isl_set *set = NULL;
190
1.80k
  isl_set_list *list1 = NULL, *list2 = NULL;
191
1.80k
192
1.80k
  if (!pw1 || !pw2)
193
0
    goto error;
194
1.80k
195
1.80k
  ctx = isl_space_get_ctx(pw1->dim);
196
1.80k
  if (!isl_space_is_equal(pw1->dim, pw2->dim))
197
1.80k
    
isl_die0
(ctx, isl_error_invalid,
198
1.80k
      "arguments should live in the same space", goto error);
199
1.80k
200
1.80k
  if (FN(PW,is_empty)(pw1)) {
201
98
    FN(PW,free)(pw1);
202
98
    return pw2;
203
98
  }
204
1.70k
205
1.70k
  if (FN(PW,is_empty)(pw2)) {
206
22
    FN(PW,free)(pw2);
207
22
    return pw1;
208
22
  }
209
1.68k
210
1.68k
  pw1 = FN(PW,sort)(pw1);
211
1.68k
  pw2 = FN(PW,sort)(pw2);
212
1.68k
  if (!pw1 || !pw2)
213
0
    goto error;
214
1.68k
215
1.68k
  list1 = FN(PW,extract_domains)(pw1);
216
1.68k
  list2 = FN(PW,extract_domains)(pw2);
217
1.68k
218
6.29k
  for (i = 0; i < pw1->n; 
++i4.61k
) {
219
9.56k
    for (j = 0; j < pw2->n; 
++j4.95k
) {
220
4.95k
      isl_bool disjoint;
221
4.95k
      isl_set *better, *set_i, *set_j;
222
4.95k
223
4.95k
      disjoint = isl_set_is_disjoint(pw1->p[i].set,
224
4.95k
              pw2->p[j].set);
225
4.95k
      if (disjoint < 0)
226
0
        goto error;
227
4.95k
      if (disjoint)
228
3.30k
        continue;
229
1.64k
      better = FN(PW,better)(pw2->p[j].FIELD,
230
1.64k
            pw1->p[i].FIELD, cmp);
231
1.64k
      set_i = isl_set_list_get_set(list1, i);
232
1.64k
      set_j = isl_set_copy(pw2->p[j].set);
233
1.64k
      set_i = FN(PW,worse_or_out)(set_i,
234
1.64k
            isl_set_copy(better), set_j);
235
1.64k
      list1 = isl_set_list_set_set(list1, i, set_i);
236
1.64k
      set_i = isl_set_copy(pw1->p[i].set);
237
1.64k
      set_j = isl_set_list_get_set(list2, j);
238
1.64k
      set_j = FN(PW,better_or_out)(set_j, better, set_i);
239
1.64k
      list2 = isl_set_list_set_set(list2, j, set_j);
240
1.64k
    }
241
4.61k
  }
242
1.68k
243
1.68k
  res = FN(PW,merge)(pw1, pw2, list1, list2);
244
1.68k
245
1.68k
  return res;
246
1.68k
error:
247
0
  isl_set_list_free(list1);
248
0
  isl_set_list_free(list2);
249
0
  FN(PW,free)(pw1);
250
0
  FN(PW,free)(pw2);
251
0
  isl_set_free(set);
252
0
  return FN(PW,free)(res);
253
1.68k
}
isl_aff.c:isl_pw_aff_union_opt_cmp
Line
Count
Source
185
365
{
186
365
  int i, j;
187
365
  PW *res = NULL;
188
365
  isl_ctx *ctx;
189
365
  isl_set *set = NULL;
190
365
  isl_set_list *list1 = NULL, *list2 = NULL;
191
365
192
365
  if (!pw1 || !pw2)
193
0
    goto error;
194
365
195
365
  ctx = isl_space_get_ctx(pw1->dim);
196
365
  if (!isl_space_is_equal(pw1->dim, pw2->dim))
197
365
    
isl_die0
(ctx, isl_error_invalid,
198
365
      "arguments should live in the same space", goto error);
199
365
200
365
  if (FN(PW,is_empty)(pw1)) {
201
0
    FN(PW,free)(pw1);
202
0
    return pw2;
203
0
  }
204
365
205
365
  if (FN(PW,is_empty)(pw2)) {
206
0
    FN(PW,free)(pw2);
207
0
    return pw1;
208
0
  }
209
365
210
365
  pw1 = FN(PW,sort)(pw1);
211
365
  pw2 = FN(PW,sort)(pw2);
212
365
  if (!pw1 || !pw2)
213
0
    goto error;
214
365
215
365
  list1 = FN(PW,extract_domains)(pw1);
216
365
  list2 = FN(PW,extract_domains)(pw2);
217
365
218
772
  for (i = 0; i < pw1->n; 
++i407
) {
219
814
    for (j = 0; j < pw2->n; 
++j407
) {
220
407
      isl_bool disjoint;
221
407
      isl_set *better, *set_i, *set_j;
222
407
223
407
      disjoint = isl_set_is_disjoint(pw1->p[i].set,
224
407
              pw2->p[j].set);
225
407
      if (disjoint < 0)
226
0
        goto error;
227
407
      if (disjoint)
228
33
        continue;
229
374
      better = FN(PW,better)(pw2->p[j].FIELD,
230
374
            pw1->p[i].FIELD, cmp);
231
374
      set_i = isl_set_list_get_set(list1, i);
232
374
      set_j = isl_set_copy(pw2->p[j].set);
233
374
      set_i = FN(PW,worse_or_out)(set_i,
234
374
            isl_set_copy(better), set_j);
235
374
      list1 = isl_set_list_set_set(list1, i, set_i);
236
374
      set_i = isl_set_copy(pw1->p[i].set);
237
374
      set_j = isl_set_list_get_set(list2, j);
238
374
      set_j = FN(PW,better_or_out)(set_j, better, set_i);
239
374
      list2 = isl_set_list_set_set(list2, j, set_j);
240
374
    }
241
407
  }
242
365
243
365
  res = FN(PW,merge)(pw1, pw2, list1, list2);
244
365
245
365
  return res;
246
365
error:
247
0
  isl_set_list_free(list1);
248
0
  isl_set_list_free(list2);
249
0
  FN(PW,free)(pw1);
250
0
  FN(PW,free)(pw2);
251
0
  isl_set_free(set);
252
0
  return FN(PW,free)(res);
253
365
}
isl_aff.c:isl_pw_multi_aff_union_opt_cmp
Line
Count
Source
185
1.43k
{
186
1.43k
  int i, j;
187
1.43k
  PW *res = NULL;
188
1.43k
  isl_ctx *ctx;
189
1.43k
  isl_set *set = NULL;
190
1.43k
  isl_set_list *list1 = NULL, *list2 = NULL;
191
1.43k
192
1.43k
  if (!pw1 || !pw2)
193
0
    goto error;
194
1.43k
195
1.43k
  ctx = isl_space_get_ctx(pw1->dim);
196
1.43k
  if (!isl_space_is_equal(pw1->dim, pw2->dim))
197
1.43k
    
isl_die0
(ctx, isl_error_invalid,
198
1.43k
      "arguments should live in the same space", goto error);
199
1.43k
200
1.43k
  if (FN(PW,is_empty)(pw1)) {
201
98
    FN(PW,free)(pw1);
202
98
    return pw2;
203
98
  }
204
1.34k
205
1.34k
  if (FN(PW,is_empty)(pw2)) {
206
22
    FN(PW,free)(pw2);
207
22
    return pw1;
208
22
  }
209
1.31k
210
1.31k
  pw1 = FN(PW,sort)(pw1);
211
1.31k
  pw2 = FN(PW,sort)(pw2);
212
1.31k
  if (!pw1 || !pw2)
213
0
    goto error;
214
1.31k
215
1.31k
  list1 = FN(PW,extract_domains)(pw1);
216
1.31k
  list2 = FN(PW,extract_domains)(pw2);
217
1.31k
218
5.52k
  for (i = 0; i < pw1->n; 
++i4.20k
) {
219
8.75k
    for (j = 0; j < pw2->n; 
++j4.54k
) {
220
4.54k
      isl_bool disjoint;
221
4.54k
      isl_set *better, *set_i, *set_j;
222
4.54k
223
4.54k
      disjoint = isl_set_is_disjoint(pw1->p[i].set,
224
4.54k
              pw2->p[j].set);
225
4.54k
      if (disjoint < 0)
226
0
        goto error;
227
4.54k
      if (disjoint)
228
3.27k
        continue;
229
1.27k
      better = FN(PW,better)(pw2->p[j].FIELD,
230
1.27k
            pw1->p[i].FIELD, cmp);
231
1.27k
      set_i = isl_set_list_get_set(list1, i);
232
1.27k
      set_j = isl_set_copy(pw2->p[j].set);
233
1.27k
      set_i = FN(PW,worse_or_out)(set_i,
234
1.27k
            isl_set_copy(better), set_j);
235
1.27k
      list1 = isl_set_list_set_set(list1, i, set_i);
236
1.27k
      set_i = isl_set_copy(pw1->p[i].set);
237
1.27k
      set_j = isl_set_list_get_set(list2, j);
238
1.27k
      set_j = FN(PW,better_or_out)(set_j, better, set_i);
239
1.27k
      list2 = isl_set_list_set_set(list2, j, set_j);
240
1.27k
    }
241
4.20k
  }
242
1.31k
243
1.31k
  res = FN(PW,merge)(pw1, pw2, list1, list2);
244
1.31k
245
1.31k
  return res;
246
1.31k
error:
247
0
  isl_set_list_free(list1);
248
0
  isl_set_list_free(list2);
249
0
  FN(PW,free)(pw1);
250
0
  FN(PW,free)(pw2);
251
0
  isl_set_free(set);
252
0
  return FN(PW,free)(res);
253
1.31k
}