Coverage Report

Created: 2019-04-21 11:35

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/polly/lib/External/isl/isl_ast_graft.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2012      Ecole Normale Superieure
3
 * Copyright 2014      INRIA Rocquencourt
4
 *
5
 * Use of this software is governed by the MIT license
6
 *
7
 * Written by Sven Verdoolaege,
8
 * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
9
 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
10
 * B.P. 105 - 78153 Le Chesnay, France
11
 */
12
13
#include <isl/id.h>
14
#include <isl/space.h>
15
#include <isl_ast_private.h>
16
#include <isl_ast_build_expr.h>
17
#include <isl_ast_build_private.h>
18
#include <isl_ast_graft_private.h>
19
20
static __isl_give isl_ast_graft *isl_ast_graft_copy(
21
  __isl_keep isl_ast_graft *graft);
22
23
#undef BASE
24
#define BASE ast_graft
25
26
#include <isl_list_templ.c>
27
28
#undef BASE
29
#define BASE ast_graft
30
#include <print_templ.c>
31
32
isl_ctx *isl_ast_graft_get_ctx(__isl_keep isl_ast_graft *graft)
33
813
{
34
813
  if (!graft)
35
0
    return NULL;
36
813
  return isl_basic_set_get_ctx(graft->enforced);
37
813
}
38
39
__isl_give isl_ast_node *isl_ast_graft_get_node(
40
  __isl_keep isl_ast_graft *graft)
41
1.57k
{
42
1.57k
  return graft ? isl_ast_node_copy(graft->node) : NULL;
43
1.57k
}
44
45
/* Create a graft for "node" with no guards and no enforced conditions.
46
 */
47
__isl_give isl_ast_graft *isl_ast_graft_alloc(
48
  __isl_take isl_ast_node *node, __isl_keep isl_ast_build *build)
49
1.59k
{
50
1.59k
  isl_ctx *ctx;
51
1.59k
  isl_space *space;
52
1.59k
  isl_ast_graft *graft;
53
1.59k
54
1.59k
  if (!node)
55
0
    return NULL;
56
1.59k
57
1.59k
  ctx = isl_ast_node_get_ctx(node);
58
1.59k
  graft = isl_calloc_type(ctx, isl_ast_graft);
59
1.59k
  if (!graft)
60
0
    goto error;
61
1.59k
62
1.59k
  space = isl_ast_build_get_space(build, 1);
63
1.59k
64
1.59k
  graft->ref = 1;
65
1.59k
  graft->node = node;
66
1.59k
  graft->guard = isl_set_universe(isl_space_copy(space));
67
1.59k
  graft->enforced = isl_basic_set_universe(space);
68
1.59k
69
1.59k
  if (!graft->guard || !graft->enforced)
70
0
    return isl_ast_graft_free(graft);
71
1.59k
72
1.59k
  return graft;
73
0
error:
74
0
  isl_ast_node_free(node);
75
0
  return NULL;
76
1.59k
}
77
78
/* Create a graft with no guards and no enforced conditions
79
 * encapsulating a call to the domain element specified by "executed".
80
 * "executed" is assumed to be single-valued.
81
 */
82
__isl_give isl_ast_graft *isl_ast_graft_alloc_domain(
83
  __isl_take isl_map *executed, __isl_keep isl_ast_build *build)
84
590
{
85
590
  isl_ast_node *node;
86
590
87
590
  node = isl_ast_build_call_from_executed(build, executed);
88
590
89
590
  return isl_ast_graft_alloc(node, build);
90
590
}
91
92
static __isl_give isl_ast_graft *isl_ast_graft_copy(
93
  __isl_keep isl_ast_graft *graft)
94
10.3k
{
95
10.3k
  if (!graft)
96
0
    return NULL;
97
10.3k
98
10.3k
  graft->ref++;
99
10.3k
  return graft;
100
10.3k
}
101
102
/* Do all the grafts in "list" have the same guard and is this guard
103
 * independent of the current depth?
104
 */
105
static int equal_independent_guards(__isl_keep isl_ast_graft_list *list,
106
  __isl_keep isl_ast_build *build)
107
1.00k
{
108
1.00k
  int i, n;
109
1.00k
  int depth;
110
1.00k
  isl_ast_graft *graft_0;
111
1.00k
  int equal = 1;
112
1.00k
  int skip;
113
1.00k
114
1.00k
  graft_0 = isl_ast_graft_list_get_ast_graft(list, 0);
115
1.00k
  if (!graft_0)
116
0
    return -1;
117
1.00k
118
1.00k
  depth = isl_ast_build_get_depth(build);
119
1.00k
  if (isl_set_dim(graft_0->guard, isl_dim_set) <= depth)
120
7
    skip = 0;
121
994
  else
122
994
    skip = isl_set_involves_dims(graft_0->guard,
123
994
            isl_dim_set, depth, 1);
124
1.00k
  if (skip < 0 || skip) {
125
8
    isl_ast_graft_free(graft_0);
126
8
    return skip < 0 ? 
-10
: 0;
127
8
  }
128
993
129
993
  n = isl_ast_graft_list_n_ast_graft(list);
130
1.36k
  for (i = 1; i < n; 
++i371
) {
131
380
    isl_ast_graft *graft;
132
380
    graft = isl_ast_graft_list_get_ast_graft(list, i);
133
380
    if (!graft)
134
0
      equal = -1;
135
380
    else
136
380
      equal = isl_set_is_equal(graft_0->guard, graft->guard);
137
380
    isl_ast_graft_free(graft);
138
380
    if (equal < 0 || !equal)
139
9
      break;
140
380
  }
141
993
142
993
  isl_ast_graft_free(graft_0);
143
993
144
993
  return equal;
145
993
}
146
147
/* Hoist "guard" out of the current level (given by "build").
148
 *
149
 * In particular, eliminate the dimension corresponding to the current depth.
150
 */
151
static __isl_give isl_set *hoist_guard(__isl_take isl_set *guard,
152
  __isl_keep isl_ast_build *build)
153
17
{
154
17
  int depth;
155
17
156
17
  depth = isl_ast_build_get_depth(build);
157
17
  if (depth < isl_set_dim(guard, isl_dim_set)) {
158
16
    guard = isl_set_remove_divs_involving_dims(guard,
159
16
            isl_dim_set, depth, 1);
160
16
    guard = isl_set_eliminate(guard, isl_dim_set, depth, 1);
161
16
    guard = isl_set_compute_divs(guard);
162
16
  }
163
17
164
17
  return guard;
165
17
}
166
167
/* Extract a common guard from the grafts in "list" that can be hoisted
168
 * out of the current level.  If no such guard can be found, then return
169
 * a universal set.
170
 *
171
 * If all the grafts in the list have the same guard and if this guard
172
 * is independent of the current level, then it can be hoisted out.
173
 * If there is only one graft in the list and if its guard
174
 * depends on the current level, then we eliminate this level and
175
 * return the result.
176
 *
177
 * Otherwise, we return the unshifted simple hull of the guards.
178
 * In order to be able to hoist as many constraints as possible,
179
 * but at the same time avoid hoisting constraints that did not
180
 * appear in the guards in the first place, we intersect the guards
181
 * with all the information that is available (i.e., the domain
182
 * from the build and the enforced constraints of the graft) and
183
 * compute the unshifted hull of the result using only constraints
184
 * from the original guards.
185
 * In particular, intersecting the guards with other known information
186
 * allows us to hoist guards that are only explicit is some of
187
 * the grafts and implicit in the others.
188
 *
189
 * The special case for equal guards is needed in case those guards
190
 * are non-convex.  Taking the simple hull would remove information
191
 * and would not allow for these guards to be hoisted completely.
192
 */
193
__isl_give isl_set *isl_ast_graft_list_extract_hoistable_guard(
194
  __isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build)
195
1.00k
{
196
1.00k
  int i, n;
197
1.00k
  int equal;
198
1.00k
  isl_ctx *ctx;
199
1.00k
  isl_set *guard;
200
1.00k
  isl_set_list *set_list;
201
1.00k
  isl_basic_set *hull;
202
1.00k
203
1.00k
  if (!list || !build)
204
0
    return NULL;
205
1.00k
206
1.00k
  n = isl_ast_graft_list_n_ast_graft(list);
207
1.00k
  if (n == 0)
208
0
    return isl_set_universe(isl_ast_build_get_space(build, 1));
209
1.00k
210
1.00k
  equal = equal_independent_guards(list, build);
211
1.00k
  if (equal < 0)
212
0
    return NULL;
213
1.00k
214
1.00k
  if (equal || 
n == 117
) {
215
984
    isl_ast_graft *graft_0;
216
984
217
984
    graft_0 = isl_ast_graft_list_get_ast_graft(list, 0);
218
984
    if (!graft_0)
219
0
      return NULL;
220
984
    guard = isl_set_copy(graft_0->guard);
221
984
    if (!equal)
222
0
      guard = hoist_guard(guard, build);
223
984
    isl_ast_graft_free(graft_0);
224
984
    return guard;
225
984
  }
226
17
227
17
  ctx = isl_ast_build_get_ctx(build);
228
17
  set_list = isl_set_list_alloc(ctx, n);
229
17
  guard = isl_set_empty(isl_ast_build_get_space(build, 1));
230
65
  for (i = 0; i < n; 
++i48
) {
231
48
    isl_ast_graft *graft;
232
48
    isl_basic_set *enforced;
233
48
    isl_set *guard_i;
234
48
235
48
    graft = isl_ast_graft_list_get_ast_graft(list, i);
236
48
    enforced = isl_ast_graft_get_enforced(graft);
237
48
    guard_i = isl_set_copy(graft->guard);
238
48
    isl_ast_graft_free(graft);
239
48
    set_list = isl_set_list_add(set_list, isl_set_copy(guard_i));
240
48
    guard_i = isl_set_intersect(guard_i,
241
48
              isl_set_from_basic_set(enforced));
242
48
    guard_i = isl_set_intersect(guard_i,
243
48
              isl_ast_build_get_domain(build));
244
48
    guard = isl_set_union(guard, guard_i);
245
48
  }
246
17
  hull = isl_set_unshifted_simple_hull_from_set_list(guard, set_list);
247
17
  guard = isl_set_from_basic_set(hull);
248
17
  return hoist_guard(guard, build);
249
17
}
250
251
/* Internal data structure used inside insert_if.
252
 *
253
 * list is the list of guarded nodes created by each call to insert_if.
254
 * node is the original node that is guarded by insert_if.
255
 * build is the build in which the AST is constructed.
256
 */
257
struct isl_insert_if_data {
258
  isl_ast_node_list *list;
259
  isl_ast_node *node;
260
  isl_ast_build *build;
261
};
262
263
static isl_stat insert_if(__isl_take isl_basic_set *bset, void *user);
264
265
/* Insert an if node around "node" testing the condition encoded
266
 * in guard "guard".
267
 *
268
 * If the user does not want any disjunctions in the if conditions
269
 * and if "guard" does involve a disjunction, then we make the different
270
 * disjuncts disjoint and insert an if node corresponding to each disjunct
271
 * around a copy of "node".  The result is then a block node containing
272
 * this sequence of guarded copies of "node".
273
 */
274
static __isl_give isl_ast_node *ast_node_insert_if(
275
  __isl_take isl_ast_node *node, __isl_take isl_set *guard,
276
  __isl_keep isl_ast_build *build)
277
46
{
278
46
  struct isl_insert_if_data data;
279
46
  isl_ctx *ctx;
280
46
281
46
  ctx = isl_ast_build_get_ctx(build);
282
46
  if (isl_options_get_ast_build_allow_or(ctx) ||
283
46
      
isl_set_n_basic_set(guard) <= 10
) {
284
46
    isl_ast_node *if_node;
285
46
    isl_ast_expr *expr;
286
46
287
46
    expr = isl_ast_build_expr_from_set_internal(build, guard);
288
46
289
46
    if_node = isl_ast_node_alloc_if(expr);
290
46
    return isl_ast_node_if_set_then(if_node, node);
291
46
  }
292
0
293
0
  guard = isl_set_make_disjoint(guard);
294
0
295
0
  data.list = isl_ast_node_list_alloc(ctx, 0);
296
0
  data.node = node;
297
0
  data.build = build;
298
0
  if (isl_set_foreach_basic_set(guard, &insert_if, &data) < 0)
299
0
    data.list = isl_ast_node_list_free(data.list);
300
0
301
0
  isl_set_free(guard);
302
0
  isl_ast_node_free(data.node);
303
0
  return isl_ast_node_alloc_block(data.list);
304
0
}
305
306
/* Insert an if node around a copy of "data->node" testing the condition
307
 * encoded in guard "bset" and add the result to data->list.
308
 */
309
static isl_stat insert_if(__isl_take isl_basic_set *bset, void *user)
310
0
{
311
0
  struct isl_insert_if_data *data = user;
312
0
  isl_ast_node *node;
313
0
  isl_set *set;
314
0
315
0
  set = isl_set_from_basic_set(bset);
316
0
  node = isl_ast_node_copy(data->node);
317
0
  node = ast_node_insert_if(node, set, data->build);
318
0
  data->list = isl_ast_node_list_add(data->list, node);
319
0
320
0
  return isl_stat_ok;
321
0
}
322
323
/* Insert an if node around graft->node testing the condition encoded
324
 * in guard "guard", assuming guard involves any conditions.
325
 */
326
static __isl_give isl_ast_graft *insert_if_node(
327
  __isl_take isl_ast_graft *graft, __isl_take isl_set *guard,
328
  __isl_keep isl_ast_build *build)
329
1.59k
{
330
1.59k
  int univ;
331
1.59k
332
1.59k
  if (!graft)
333
0
    goto error;
334
1.59k
335
1.59k
  univ = isl_set_plain_is_universe(guard);
336
1.59k
  if (univ < 0)
337
0
    goto error;
338
1.59k
  if (univ) {
339
1.54k
    isl_set_free(guard);
340
1.54k
    return graft;
341
1.54k
  }
342
46
343
46
  build = isl_ast_build_copy(build);
344
46
  graft->node = ast_node_insert_if(graft->node, guard, build);
345
46
  isl_ast_build_free(build);
346
46
347
46
  if (!graft->node)
348
0
    return isl_ast_graft_free(graft);
349
46
350
46
  return graft;
351
0
error:
352
0
  isl_set_free(guard);
353
0
  return isl_ast_graft_free(graft);
354
46
}
355
356
/* Insert an if node around graft->node testing the condition encoded
357
 * in graft->guard, assuming graft->guard involves any conditions.
358
 */
359
static __isl_give isl_ast_graft *insert_pending_guard_node(
360
  __isl_take isl_ast_graft *graft, __isl_keep isl_ast_build *build)
361
1.59k
{
362
1.59k
  if (!graft)
363
0
    return NULL;
364
1.59k
365
1.59k
  return insert_if_node(graft, isl_set_copy(graft->guard), build);
366
1.59k
}
367
368
/* Replace graft->enforced by "enforced".
369
 */
370
__isl_give isl_ast_graft *isl_ast_graft_set_enforced(
371
  __isl_take isl_ast_graft *graft, __isl_take isl_basic_set *enforced)
372
20
{
373
20
  if (!graft || !enforced)
374
0
    goto error;
375
20
376
20
  isl_basic_set_free(graft->enforced);
377
20
  graft->enforced = enforced;
378
20
379
20
  return graft;
380
0
error:
381
0
  isl_basic_set_free(enforced);
382
0
  return isl_ast_graft_free(graft);
383
20
}
384
385
/* Update "enforced" such that it only involves constraints that are
386
 * also enforced by "graft".
387
 */
388
static __isl_give isl_basic_set *update_enforced(
389
  __isl_take isl_basic_set *enforced, __isl_keep isl_ast_graft *graft,
390
  int depth)
391
1.44k
{
392
1.44k
  isl_basic_set *enforced_g;
393
1.44k
394
1.44k
  enforced_g = isl_ast_graft_get_enforced(graft);
395
1.44k
  if (depth < isl_basic_set_dim(enforced_g, isl_dim_set))
396
1.39k
    enforced_g = isl_basic_set_eliminate(enforced_g,
397
1.39k
              isl_dim_set, depth, 1);
398
1.44k
  enforced_g = isl_basic_set_remove_unknown_divs(enforced_g);
399
1.44k
  enforced_g = isl_basic_set_align_params(enforced_g,
400
1.44k
        isl_basic_set_get_space(enforced));
401
1.44k
  enforced = isl_basic_set_align_params(enforced,
402
1.44k
        isl_basic_set_get_space(enforced_g));
403
1.44k
  enforced = isl_set_simple_hull(isl_basic_set_union(enforced,
404
1.44k
            enforced_g));
405
1.44k
406
1.44k
  return enforced;
407
1.44k
}
408
409
/* Extend the node at *body with node.
410
 *
411
 * If body points to the else branch, then *body may still be NULL.
412
 * If so, we simply attach node to this else branch.
413
 * Otherwise, we attach a list containing the statements already
414
 * attached at *body followed by node.
415
 */
416
static void extend_body(__isl_keep isl_ast_node **body,
417
  __isl_take isl_ast_node *node)
418
20
{
419
20
  isl_ast_node_list *list;
420
20
421
20
  if  (!*body) {
422
9
    *body = node;
423
9
    return;
424
9
  }
425
11
426
11
  if ((*body)->type == isl_ast_node_block) {
427
2
    list = isl_ast_node_block_get_children(*body);
428
2
    isl_ast_node_free(*body);
429
2
  } else
430
9
    list = isl_ast_node_list_from_ast_node(*body);
431
11
  list = isl_ast_node_list_add(list, node);
432
11
  *body = isl_ast_node_alloc_block(list);
433
11
}
434
435
/* Merge "graft" into the last graft of "list".
436
 * body points to the then or else branch of an if node in that last graft.
437
 *
438
 * We attach graft->node to this branch and update the enforced
439
 * set of the last graft of "list" to take into account the enforced
440
 * set of "graft".
441
 */
442
static __isl_give isl_ast_graft_list *graft_extend_body(
443
  __isl_take isl_ast_graft_list *list,
444
  __isl_keep isl_ast_node **body, __isl_take isl_ast_graft *graft,
445
  __isl_keep isl_ast_build *build)
446
20
{
447
20
  int n;
448
20
  int depth;
449
20
  isl_ast_graft *last;
450
20
  isl_space *space;
451
20
  isl_basic_set *enforced;
452
20
453
20
  if (!list || !graft)
454
0
    goto error;
455
20
  extend_body(body, isl_ast_node_copy(graft->node));
456
20
  if (!*body)
457
0
    goto error;
458
20
459
20
  n = isl_ast_graft_list_n_ast_graft(list);
460
20
  last = isl_ast_graft_list_get_ast_graft(list, n - 1);
461
20
462
20
  depth = isl_ast_build_get_depth(build);
463
20
  space = isl_ast_build_get_space(build, 1);
464
20
  enforced = isl_basic_set_empty(space);
465
20
  enforced = update_enforced(enforced, last, depth);
466
20
  enforced = update_enforced(enforced, graft, depth);
467
20
  last = isl_ast_graft_set_enforced(last, enforced);
468
20
469
20
  list = isl_ast_graft_list_set_ast_graft(list, n - 1, last);
470
20
  isl_ast_graft_free(graft);
471
20
  return list;
472
0
error:
473
0
  isl_ast_graft_free(graft);
474
0
  return isl_ast_graft_list_free(list);
475
20
}
476
477
/* Merge "graft" into the last graft of "list", attaching graft->node
478
 * to the then branch of "last_if".
479
 */
480
static __isl_give isl_ast_graft_list *extend_then(
481
  __isl_take isl_ast_graft_list *list,
482
  __isl_keep isl_ast_node *last_if, __isl_take isl_ast_graft *graft,
483
  __isl_keep isl_ast_build *build)
484
9
{
485
9
  return graft_extend_body(list, &last_if->u.i.then, graft, build);
486
9
}
487
488
/* Merge "graft" into the last graft of "list", attaching graft->node
489
 * to the else branch of "last_if".
490
 */
491
static __isl_give isl_ast_graft_list *extend_else(
492
  __isl_take isl_ast_graft_list *list,
493
  __isl_keep isl_ast_node *last_if, __isl_take isl_ast_graft *graft,
494
  __isl_keep isl_ast_build *build)
495
11
{
496
11
  return graft_extend_body(list, &last_if->u.i.else_node, graft, build);
497
11
}
498
499
/* This data structure keeps track of an if node.
500
 *
501
 * "node" is the actual if-node
502
 * "guard" is the original, non-simplified guard of the node
503
 * "complement" is the complement of "guard" in the context of outer if nodes
504
 */
505
struct isl_if_node {
506
  isl_ast_node *node;
507
  isl_set *guard;
508
  isl_set *complement;
509
};
510
511
/* Given a list of "n" if nodes, clear those starting at "first"
512
 * and return "first" (i.e., the updated size of the array).
513
 */
514
static int clear_if_nodes(struct isl_if_node *if_node, int first, int n)
515
1.18k
{
516
1.18k
  int i;
517
1.18k
518
1.20k
  for (i = first; i < n; 
++i27
) {
519
27
    isl_set_free(if_node[i].guard);
520
27
    isl_set_free(if_node[i].complement);
521
27
  }
522
1.18k
523
1.18k
  return first;
524
1.18k
}
525
526
/* For each graft in "list",
527
 * insert an if node around graft->node testing the condition encoded
528
 * in graft->guard, assuming graft->guard involves any conditions.
529
 *
530
 * We keep track of a list of generated if nodes that can be extended
531
 * without changing the order of the elements in "list".
532
 * If the guard of a graft is a subset of either the guard or its complement
533
 * of one of those if nodes, then the node
534
 * of the new graft is inserted into the then or else branch of the last graft
535
 * and the current graft is discarded.
536
 * The guard of the node is then simplified based on the conditions
537
 * enforced at that then or else branch.
538
 * Otherwise, the current graft is appended to the list.
539
 *
540
 * We only construct else branches if allowed by the user.
541
 */
542
static __isl_give isl_ast_graft_list *insert_pending_guard_nodes(
543
  __isl_take isl_ast_graft_list *list,
544
  __isl_keep isl_ast_build *build)
545
1.14k
{
546
1.14k
  int i, j, n, n_if;
547
1.14k
  int allow_else;
548
1.14k
  isl_ctx *ctx;
549
1.14k
  isl_ast_graft_list *res;
550
1.14k
  struct isl_if_node *if_node = NULL;
551
1.14k
552
1.14k
  if (!build || !list)
553
0
    return isl_ast_graft_list_free(list);
554
1.14k
555
1.14k
  ctx = isl_ast_build_get_ctx(build);
556
1.14k
  n = isl_ast_graft_list_n_ast_graft(list);
557
1.14k
558
1.14k
  allow_else = isl_options_get_ast_build_allow_else(ctx);
559
1.14k
560
1.14k
  n_if = 0;
561
1.14k
  if (n > 1) {
562
97
    if_node = isl_alloc_array(ctx, struct isl_if_node, n - 1);
563
97
    if (!if_node)
564
0
      return isl_ast_graft_list_free(list);
565
1.14k
  }
566
1.14k
567
1.14k
  res = isl_ast_graft_list_alloc(ctx, n);
568
1.14k
569
2.74k
  for (i = 0; i < n; 
++i1.59k
) {
570
1.59k
    isl_set *guard;
571
1.59k
    isl_ast_graft *graft;
572
1.59k
    int subset, found_then, found_else;
573
1.59k
    isl_ast_node *node;
574
1.59k
575
1.59k
    graft = isl_ast_graft_list_get_ast_graft(list, i);
576
1.59k
    if (!graft)
577
0
      break;
578
1.59k
    subset = 0;
579
1.59k
    found_then = found_else = -1;
580
1.59k
    if (n_if > 0) {
581
34
      isl_set *test;
582
34
      test = isl_set_copy(graft->guard);
583
34
      test = isl_set_intersect(test,
584
34
            isl_set_copy(build->domain));
585
48
      for (j = n_if - 1; j >= 0; 
--j14
) {
586
34
        subset = isl_set_is_subset(test,
587
34
              if_node[j].guard);
588
34
        if (subset < 0 || subset) {
589
9
          found_then = j;
590
9
          break;
591
9
        }
592
25
        if (!allow_else)
593
0
          continue;
594
25
        subset = isl_set_is_subset(test,
595
25
              if_node[j].complement);
596
25
        if (subset < 0 || subset) {
597
11
          found_else = j;
598
11
          break;
599
11
        }
600
25
      }
601
34
      n_if = clear_if_nodes(if_node, j + 1, n_if);
602
34
      isl_set_free(test);
603
34
    }
604
1.59k
    if (subset < 0) {
605
0
      graft = isl_ast_graft_free(graft);
606
0
      break;
607
0
    }
608
1.59k
609
1.59k
    guard = isl_set_copy(graft->guard);
610
1.59k
    if (found_then >= 0)
611
9
      graft->guard = isl_set_gist(graft->guard,
612
9
        isl_set_copy(if_node[found_then].guard));
613
1.58k
    else if (found_else >= 0)
614
11
      graft->guard = isl_set_gist(graft->guard,
615
11
        isl_set_copy(if_node[found_else].complement));
616
1.59k
617
1.59k
    node = graft->node;
618
1.59k
    if (!graft->guard)
619
0
      graft = isl_ast_graft_free(graft);
620
1.59k
    graft = insert_pending_guard_node(graft, build);
621
1.59k
    if (graft && graft->node != node && 
i != n - 146
) {
622
27
      isl_set *set;
623
27
      if_node[n_if].node = graft->node;
624
27
      if_node[n_if].guard = guard;
625
27
      if (found_then >= 0)
626
3
        set = if_node[found_then].guard;
627
24
      else if (found_else >= 0)
628
1
        set = if_node[found_else].complement;
629
23
      else
630
23
        set = build->domain;
631
27
      set = isl_set_copy(set);
632
27
      set = isl_set_subtract(set, isl_set_copy(guard));
633
27
      if_node[n_if].complement = set;
634
27
      n_if++;
635
27
    } else
636
1.56k
      isl_set_free(guard);
637
1.59k
    if (!graft)
638
0
      break;
639
1.59k
640
1.59k
    if (found_then >= 0)
641
9
      res = extend_then(res, if_node[found_then].node,
642
9
            graft, build);
643
1.58k
    else if (found_else >= 0)
644
11
      res = extend_else(res, if_node[found_else].node,
645
11
            graft, build);
646
1.57k
    else
647
1.57k
      res = isl_ast_graft_list_add(res, graft);
648
1.59k
  }
649
1.14k
  if (i < n)
650
0
    res = isl_ast_graft_list_free(res);
651
1.14k
652
1.14k
  isl_ast_graft_list_free(list);
653
1.14k
  clear_if_nodes(if_node, 0, n_if);
654
1.14k
  free(if_node);
655
1.14k
  return res;
656
1.14k
}
657
658
/* For each graft in "list",
659
 * insert an if node around graft->node testing the condition encoded
660
 * in graft->guard, assuming graft->guard involves any conditions.
661
 * Subsequently remove the guards from the grafts.
662
 */
663
__isl_give isl_ast_graft_list *isl_ast_graft_list_insert_pending_guard_nodes(
664
  __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build)
665
0
{
666
0
  int i, n;
667
0
  isl_set *universe;
668
0
669
0
  list = insert_pending_guard_nodes(list, build);
670
0
  if (!list)
671
0
    return NULL;
672
0
673
0
  universe = isl_set_universe(isl_ast_build_get_space(build, 1));
674
0
  n = isl_ast_graft_list_n_ast_graft(list);
675
0
  for (i = 0; i < n; ++i) {
676
0
    isl_ast_graft *graft;
677
0
678
0
    graft = isl_ast_graft_list_get_ast_graft(list, i);
679
0
    if (!graft)
680
0
      break;
681
0
    isl_set_free(graft->guard);
682
0
    graft->guard = isl_set_copy(universe);
683
0
    if (!graft->guard)
684
0
      graft = isl_ast_graft_free(graft);
685
0
    list = isl_ast_graft_list_set_ast_graft(list, i, graft);
686
0
  }
687
0
  isl_set_free(universe);
688
0
  if (i < n)
689
0
    return isl_ast_graft_list_free(list);
690
0
691
0
  return list;
692
0
}
693
694
/* Collect the nodes contained in the grafts in "list" in a node list.
695
 */
696
static __isl_give isl_ast_node_list *extract_node_list(
697
  __isl_keep isl_ast_graft_list *list)
698
1.14k
{
699
1.14k
  int i, n;
700
1.14k
  isl_ctx *ctx;
701
1.14k
  isl_ast_node_list *node_list;
702
1.14k
703
1.14k
  if (!list)
704
0
    return NULL;
705
1.14k
  ctx = isl_ast_graft_list_get_ctx(list);
706
1.14k
  n = isl_ast_graft_list_n_ast_graft(list);
707
1.14k
  node_list = isl_ast_node_list_alloc(ctx, n);
708
2.72k
  for (i = 0; i < n; 
++i1.57k
) {
709
1.57k
    isl_ast_node *node;
710
1.57k
    isl_ast_graft *graft;
711
1.57k
712
1.57k
    graft = isl_ast_graft_list_get_ast_graft(list, i);
713
1.57k
    node = isl_ast_graft_get_node(graft);
714
1.57k
    node_list = isl_ast_node_list_add(node_list, node);
715
1.57k
    isl_ast_graft_free(graft);
716
1.57k
  }
717
1.14k
718
1.14k
  return node_list;
719
1.14k
}
720
721
/* Look for shared enforced constraints by all the elements in "list"
722
 * on outer loops (with respect to the current depth) and return the result.
723
 *
724
 * If there are no elements in "list", then return the empty set.
725
 */
726
__isl_give isl_basic_set *isl_ast_graft_list_extract_shared_enforced(
727
  __isl_keep isl_ast_graft_list *list,
728
  __isl_keep isl_ast_build *build)
729
999
{
730
999
  int i, n;
731
999
  int depth;
732
999
  isl_space *space;
733
999
  isl_basic_set *enforced;
734
999
735
999
  if (!list)
736
0
    return NULL;
737
999
738
999
  space = isl_ast_build_get_space(build, 1);
739
999
  enforced = isl_basic_set_empty(space);
740
999
741
999
  depth = isl_ast_build_get_depth(build);
742
999
  n = isl_ast_graft_list_n_ast_graft(list);
743
2.40k
  for (i = 0; i < n; 
++i1.40k
) {
744
1.40k
    isl_ast_graft *graft;
745
1.40k
746
1.40k
    graft = isl_ast_graft_list_get_ast_graft(list, i);
747
1.40k
    enforced = update_enforced(enforced, graft, depth);
748
1.40k
    isl_ast_graft_free(graft);
749
1.40k
  }
750
999
751
999
  return enforced;
752
999
}
753
754
/* Record "guard" in "graft" so that it will be enforced somewhere
755
 * up the tree.  If the graft already has a guard, then it may be partially
756
 * redundant in combination with the new guard and in the context
757
 * the generated constraints of "build".  In fact, the new guard
758
 * may in itself have some redundant constraints.
759
 * We therefore (re)compute the gist of the intersection
760
 * and coalesce the result.
761
 */
762
static __isl_give isl_ast_graft *store_guard(__isl_take isl_ast_graft *graft,
763
  __isl_take isl_set *guard, __isl_keep isl_ast_build *build)
764
1.59k
{
765
1.59k
  int is_universe;
766
1.59k
767
1.59k
  if (!graft)
768
0
    goto error;
769
1.59k
770
1.59k
  is_universe = isl_set_plain_is_universe(guard);
771
1.59k
  if (is_universe < 0)
772
0
    goto error;
773
1.59k
  if (is_universe) {
774
1.49k
    isl_set_free(guard);
775
1.49k
    return graft;
776
1.49k
  }
777
102
778
102
  graft->guard = isl_set_intersect(graft->guard, guard);
779
102
  graft->guard = isl_set_gist(graft->guard,
780
102
            isl_ast_build_get_generated(build));
781
102
  graft->guard = isl_set_coalesce(graft->guard);
782
102
  if (!graft->guard)
783
0
    return isl_ast_graft_free(graft);
784
102
785
102
  return graft;
786
0
error:
787
0
  isl_set_free(guard);
788
0
  return isl_ast_graft_free(graft);
789
102
}
790
791
/* For each graft in "list", replace its guard with the gist with
792
 * respect to "context".
793
 */
794
static __isl_give isl_ast_graft_list *gist_guards(
795
  __isl_take isl_ast_graft_list *list, __isl_keep isl_set *context)
796
1.00k
{
797
1.00k
  int i, n;
798
1.00k
799
1.00k
  if (!list)
800
0
    return NULL;
801
1.00k
802
1.00k
  n = isl_ast_graft_list_n_ast_graft(list);
803
2.40k
  for (i = 0; i < n; 
++i1.40k
) {
804
1.40k
    isl_ast_graft *graft;
805
1.40k
806
1.40k
    graft = isl_ast_graft_list_get_ast_graft(list, i);
807
1.40k
    if (!graft)
808
0
      break;
809
1.40k
    graft->guard = isl_set_gist(graft->guard,
810
1.40k
            isl_set_copy(context));
811
1.40k
    if (!graft->guard)
812
0
      graft = isl_ast_graft_free(graft);
813
1.40k
    list = isl_ast_graft_list_set_ast_graft(list, i, graft);
814
1.40k
  }
815
1.00k
  if (i < n)
816
0
    return isl_ast_graft_list_free(list);
817
1.00k
818
1.00k
  return list;
819
1.00k
}
820
821
/* For each graft in "list", replace its guard with the gist with
822
 * respect to "context".
823
 */
824
__isl_give isl_ast_graft_list *isl_ast_graft_list_gist_guards(
825
  __isl_take isl_ast_graft_list *list, __isl_take isl_set *context)
826
2
{
827
2
  list = gist_guards(list, context);
828
2
  isl_set_free(context);
829
2
830
2
  return list;
831
2
}
832
833
/* Allocate a graft in "build" based on the list of grafts in "sub_build".
834
 * "guard" and "enforced" are the guard and enforced constraints
835
 * of the allocated graft.  The guard is used to simplify the guards
836
 * of the elements in "list".
837
 *
838
 * The node is initialized to either a block containing the nodes of "children"
839
 * or, if there is only a single child, the node of that child.
840
 * If the current level requires a for node, it should be inserted by
841
 * a subsequent call to isl_ast_graft_insert_for.
842
 */
843
__isl_give isl_ast_graft *isl_ast_graft_alloc_from_children(
844
  __isl_take isl_ast_graft_list *list, __isl_take isl_set *guard,
845
  __isl_take isl_basic_set *enforced, __isl_keep isl_ast_build *build,
846
  __isl_keep isl_ast_build *sub_build)
847
1.00k
{
848
1.00k
  isl_ast_build *guard_build;
849
1.00k
  isl_ast_node *node;
850
1.00k
  isl_ast_node_list *node_list;
851
1.00k
  isl_ast_graft *graft;
852
1.00k
853
1.00k
  guard_build = isl_ast_build_copy(sub_build);
854
1.00k
  guard_build = isl_ast_build_replace_pending_by_guard(guard_build,
855
1.00k
            isl_set_copy(guard));
856
1.00k
  list = gist_guards(list, guard);
857
1.00k
  list = insert_pending_guard_nodes(list, guard_build);
858
1.00k
  isl_ast_build_free(guard_build);
859
1.00k
860
1.00k
  node_list = extract_node_list(list);
861
1.00k
  node = isl_ast_node_from_ast_node_list(node_list);
862
1.00k
  isl_ast_graft_list_free(list);
863
1.00k
864
1.00k
  graft = isl_ast_graft_alloc(node, build);
865
1.00k
  graft = store_guard(graft, guard, build);
866
1.00k
  graft = isl_ast_graft_enforce(graft, enforced);
867
1.00k
868
1.00k
  return graft;
869
1.00k
}
870
871
/* Combine the grafts in the list into a single graft.
872
 *
873
 * The guard is initialized to the shared guard of the list elements (if any),
874
 * provided it does not depend on the current dimension.
875
 * The guards in the elements are then simplified with respect to the
876
 * hoisted guard and materialized as if nodes around the contained AST nodes
877
 * in the context of "sub_build".
878
 *
879
 * The enforced set is initialized to the simple hull of the enforced sets
880
 * of the elements, provided the ast_build_exploit_nested_bounds option is set
881
 * or the new graft will be used at the same level.
882
 *
883
 * The node is initialized to either a block containing the nodes of "list"
884
 * or, if there is only a single element, the node of that element.
885
 */
886
static __isl_give isl_ast_graft *ast_graft_list_fuse(
887
  __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build)
888
13
{
889
13
  isl_ast_graft *graft;
890
13
  isl_basic_set *enforced;
891
13
  isl_set *guard;
892
13
893
13
  if (!list)
894
0
    return NULL;
895
13
896
13
  enforced = isl_ast_graft_list_extract_shared_enforced(list, build);
897
13
  guard = isl_ast_graft_list_extract_hoistable_guard(list, build);
898
13
  graft = isl_ast_graft_alloc_from_children(list, guard, enforced,
899
13
                build, build);
900
13
901
13
  return graft;
902
13
}
903
904
/* Combine the grafts in the list into a single graft.
905
 * Return a list containing this single graft.
906
 * If the original list is empty, then return an empty list.
907
 */
908
__isl_give isl_ast_graft_list *isl_ast_graft_list_fuse(
909
  __isl_take isl_ast_graft_list *list,
910
  __isl_keep isl_ast_build *build)
911
329
{
912
329
  isl_ast_graft *graft;
913
329
914
329
  if (!list)
915
0
    return NULL;
916
329
  if (isl_ast_graft_list_n_ast_graft(list) <= 1)
917
322
    return list;
918
7
  graft = ast_graft_list_fuse(list, build);
919
7
  return isl_ast_graft_list_from_ast_graft(graft);
920
7
}
921
922
/* Combine the two grafts into a single graft.
923
 * Return a list containing this single graft.
924
 */
925
static __isl_give isl_ast_graft *isl_ast_graft_fuse(
926
  __isl_take isl_ast_graft *graft1, __isl_take isl_ast_graft *graft2,
927
  __isl_keep isl_ast_build *build)
928
6
{
929
6
  isl_ctx *ctx;
930
6
  isl_ast_graft_list *list;
931
6
932
6
  ctx = isl_ast_build_get_ctx(build);
933
6
934
6
  list = isl_ast_graft_list_alloc(ctx, 2);
935
6
  list = isl_ast_graft_list_add(list, graft1);
936
6
  list = isl_ast_graft_list_add(list, graft2);
937
6
938
6
  return ast_graft_list_fuse(list, build);
939
6
}
940
941
/* Insert a for node enclosing the current graft->node.
942
 */
943
__isl_give isl_ast_graft *isl_ast_graft_insert_for(
944
  __isl_take isl_ast_graft *graft, __isl_take isl_ast_node *node)
945
213
{
946
213
  if (!graft)
947
0
    goto error;
948
213
949
213
  graft->node = isl_ast_node_for_set_body(node, graft->node);
950
213
  if (!graft->node)
951
0
    return isl_ast_graft_free(graft);
952
213
953
213
  return graft;
954
0
error:
955
0
  isl_ast_node_free(node);
956
0
  isl_ast_graft_free(graft);
957
0
  return NULL;
958
213
}
959
960
/* Insert a mark governing the current graft->node.
961
 */
962
__isl_give isl_ast_graft *isl_ast_graft_insert_mark(
963
  __isl_take isl_ast_graft *graft, __isl_take isl_id *mark)
964
48
{
965
48
  if (!graft)
966
0
    goto error;
967
48
968
48
  graft->node = isl_ast_node_alloc_mark(mark, graft->node);
969
48
  if (!graft->node)
970
0
    return isl_ast_graft_free(graft);
971
48
972
48
  return graft;
973
0
error:
974
0
  isl_id_free(mark);
975
0
  isl_ast_graft_free(graft);
976
0
  return NULL;
977
48
}
978
979
/* Represent the graft list as an AST node.
980
 * This operation drops the information about guards in the grafts, so
981
 * if there are any pending guards, then they are materialized as if nodes.
982
 */
983
__isl_give isl_ast_node *isl_ast_node_from_graft_list(
984
  __isl_take isl_ast_graft_list *list,
985
  __isl_keep isl_ast_build *build)
986
145
{
987
145
  isl_ast_node_list *node_list;
988
145
989
145
  list = insert_pending_guard_nodes(list, build);
990
145
  node_list = extract_node_list(list);
991
145
  isl_ast_graft_list_free(list);
992
145
993
145
  return isl_ast_node_from_ast_node_list(node_list);
994
145
}
995
996
__isl_null isl_ast_graft *isl_ast_graft_free(__isl_take isl_ast_graft *graft)
997
11.9k
{
998
11.9k
  if (!graft)
999
0
    return NULL;
1000
11.9k
1001
11.9k
  if (--graft->ref > 0)
1002
10.3k
    return NULL;
1003
1.59k
1004
1.59k
  isl_ast_node_free(graft->node);
1005
1.59k
  isl_set_free(graft->guard);
1006
1.59k
  isl_basic_set_free(graft->enforced);
1007
1.59k
  free(graft);
1008
1.59k
1009
1.59k
  return NULL;
1010
1.59k
}
1011
1012
/* Record that the grafted tree enforces
1013
 * "enforced" by intersecting graft->enforced with "enforced".
1014
 */
1015
__isl_give isl_ast_graft *isl_ast_graft_enforce(
1016
  __isl_take isl_ast_graft *graft, __isl_take isl_basic_set *enforced)
1017
1.21k
{
1018
1.21k
  if (!graft || !enforced)
1019
0
    goto error;
1020
1.21k
1021
1.21k
  enforced = isl_basic_set_align_params(enforced,
1022
1.21k
        isl_basic_set_get_space(graft->enforced));
1023
1.21k
  graft->enforced = isl_basic_set_align_params(graft->enforced,
1024
1.21k
        isl_basic_set_get_space(enforced));
1025
1.21k
  graft->enforced = isl_basic_set_intersect(graft->enforced, enforced);
1026
1.21k
  if (!graft->enforced)
1027
0
    return isl_ast_graft_free(graft);
1028
1.21k
1029
1.21k
  return graft;
1030
0
error:
1031
0
  isl_basic_set_free(enforced);
1032
0
  return isl_ast_graft_free(graft);
1033
1.21k
}
1034
1035
__isl_give isl_basic_set *isl_ast_graft_get_enforced(
1036
  __isl_keep isl_ast_graft *graft)
1037
1.48k
{
1038
1.48k
  return graft ? isl_basic_set_copy(graft->enforced) : NULL;
1039
1.48k
}
1040
1041
__isl_give isl_set *isl_ast_graft_get_guard(__isl_keep isl_ast_graft *graft)
1042
0
{
1043
0
  return graft ? isl_set_copy(graft->guard) : NULL;
1044
0
}
1045
1046
/* Record that "guard" needs to be inserted in "graft".
1047
 */
1048
__isl_give isl_ast_graft *isl_ast_graft_add_guard(
1049
  __isl_take isl_ast_graft *graft,
1050
  __isl_take isl_set *guard, __isl_keep isl_ast_build *build)
1051
594
{
1052
594
  return store_guard(graft, guard, build);
1053
594
}
1054
1055
/* Reformulate the "graft", which was generated in the context
1056
 * of an inner code generation, in terms of the outer code generation
1057
 * AST build.
1058
 *
1059
 * If "product" is set, then the domain of the inner code generation build is
1060
 *
1061
 *  [O -> S]
1062
 *
1063
 * with O the domain of the outer code generation build.
1064
 * We essentially need to project out S.
1065
 *
1066
 * If "product" is not set, then we need to project the domains onto
1067
 * their parameter spaces.
1068
 */
1069
__isl_give isl_ast_graft *isl_ast_graft_unembed(__isl_take isl_ast_graft *graft,
1070
  int product)
1071
235
{
1072
235
  isl_basic_set *enforced;
1073
235
1074
235
  if (!graft)
1075
0
    return NULL;
1076
235
1077
235
  if (product) {
1078
227
    enforced = graft->enforced;
1079
227
    enforced = isl_basic_map_domain(isl_basic_set_unwrap(enforced));
1080
227
    graft->enforced = enforced;
1081
227
    graft->guard = isl_map_domain(isl_set_unwrap(graft->guard));
1082
227
  } else {
1083
8
    graft->enforced = isl_basic_set_params(graft->enforced);
1084
8
    graft->guard = isl_set_params(graft->guard);
1085
8
  }
1086
235
  graft->guard = isl_set_compute_divs(graft->guard);
1087
235
1088
235
  if (!graft->enforced || !graft->guard)
1089
0
    return isl_ast_graft_free(graft);
1090
235
1091
235
  return graft;
1092
235
}
1093
1094
/* Reformulate the grafts in "list", which were generated in the context
1095
 * of an inner code generation, in terms of the outer code generation
1096
 * AST build.
1097
 */
1098
__isl_give isl_ast_graft_list *isl_ast_graft_list_unembed(
1099
  __isl_take isl_ast_graft_list *list, int product)
1100
200
{
1101
200
  int i, n;
1102
200
1103
200
  n = isl_ast_graft_list_n_ast_graft(list);
1104
435
  for (i = 0; i < n; 
++i235
) {
1105
235
    isl_ast_graft *graft;
1106
235
1107
235
    graft = isl_ast_graft_list_get_ast_graft(list, i);
1108
235
    graft = isl_ast_graft_unembed(graft, product);
1109
235
    list = isl_ast_graft_list_set_ast_graft(list, i, graft);
1110
235
  }
1111
200
1112
200
  return list;
1113
200
}
1114
1115
/* Compute the preimage of "graft" under the function represented by "ma".
1116
 * In other words, plug in "ma" in "enforced" and "guard" fields of "graft".
1117
 */
1118
__isl_give isl_ast_graft *isl_ast_graft_preimage_multi_aff(
1119
  __isl_take isl_ast_graft *graft, __isl_take isl_multi_aff *ma)
1120
1
{
1121
1
  isl_basic_set *enforced;
1122
1
1123
1
  if (!graft)
1124
0
    return NULL;
1125
1
1126
1
  enforced = graft->enforced;
1127
1
  graft->enforced = isl_basic_set_preimage_multi_aff(enforced,
1128
1
            isl_multi_aff_copy(ma));
1129
1
  graft->guard = isl_set_preimage_multi_aff(graft->guard, ma);
1130
1
1131
1
  if (!graft->enforced || !graft->guard)
1132
0
    return isl_ast_graft_free(graft);
1133
1
1134
1
  return graft;
1135
1
}
1136
1137
/* Compute the preimage of all the grafts in "list" under
1138
 * the function represented by "ma".
1139
 */
1140
__isl_give isl_ast_graft_list *isl_ast_graft_list_preimage_multi_aff(
1141
  __isl_take isl_ast_graft_list *list, __isl_take isl_multi_aff *ma)
1142
1
{
1143
1
  int i, n;
1144
1
1145
1
  n = isl_ast_graft_list_n_ast_graft(list);
1146
2
  for (i = 0; i < n; 
++i1
) {
1147
1
    isl_ast_graft *graft;
1148
1
1149
1
    graft = isl_ast_graft_list_get_ast_graft(list, i);
1150
1
    graft = isl_ast_graft_preimage_multi_aff(graft,
1151
1
                isl_multi_aff_copy(ma));
1152
1
    list = isl_ast_graft_list_set_ast_graft(list, i, graft);
1153
1
  }
1154
1
1155
1
  isl_multi_aff_free(ma);
1156
1
  return list;
1157
1
}
1158
1159
/* Compare two grafts based on their guards.
1160
 */
1161
static int cmp_graft(__isl_keep isl_ast_graft *a, __isl_keep isl_ast_graft *b,
1162
  void *user)
1163
5
{
1164
5
  return isl_set_plain_cmp(a->guard, b->guard);
1165
5
}
1166
1167
/* Order the elements in "list" based on their guards.
1168
 */
1169
__isl_give isl_ast_graft_list *isl_ast_graft_list_sort_guard(
1170
  __isl_take isl_ast_graft_list *list)
1171
6
{
1172
6
  return isl_ast_graft_list_sort(list, &cmp_graft, NULL);
1173
6
}
1174
1175
/* Merge the given two lists into a single list of grafts,
1176
 * merging grafts with the same guard into a single graft.
1177
 *
1178
 * "list2" has been sorted using isl_ast_graft_list_sort.
1179
 * "list1" may be the result of a previous call to isl_ast_graft_list_merge
1180
 * and may therefore not be completely sorted.
1181
 *
1182
 * The elements in "list2" need to be executed after those in "list1",
1183
 * but if the guard of a graft in "list2" is disjoint from the guards
1184
 * of some final elements in "list1", then it can be moved up to before
1185
 * those final elements.
1186
 *
1187
 * In particular, we look at each element g of "list2" in turn
1188
 * and move it up beyond elements of "list1" that would be sorted
1189
 * after g as long as each of these elements has a guard that is disjoint
1190
 * from that of g.
1191
 *
1192
 * We do not allow the second or any later element of "list2" to be moved
1193
 * before a previous elements of "list2" even if the reason that
1194
 * that element didn't move up further was that its guard was not disjoint
1195
 * from that of the previous element in "list1".
1196
 */
1197
__isl_give isl_ast_graft_list *isl_ast_graft_list_merge(
1198
  __isl_take isl_ast_graft_list *list1,
1199
  __isl_take isl_ast_graft_list *list2,
1200
  __isl_keep isl_ast_build *build)
1201
57
{
1202
57
  int i, j, first;
1203
57
1204
57
  if (!list1 || !list2 || !build)
1205
0
    goto error;
1206
57
  if (list2->n == 0) {
1207
0
    isl_ast_graft_list_free(list2);
1208
0
    return list1;
1209
0
  }
1210
57
  if (list1->n == 0) {
1211
41
    isl_ast_graft_list_free(list1);
1212
41
    return list2;
1213
41
  }
1214
16
1215
16
  first = 0;
1216
33
  for (i = 0; i < list2->n; 
++i17
) {
1217
17
    isl_ast_graft *graft;
1218
17
    graft = isl_ast_graft_list_get_ast_graft(list2, i);
1219
17
    if (!graft)
1220
0
      break;
1221
17
1222
19
    
for (j = list1->n; 17
j >= 0;
--j2
) {
1223
19
      int cmp, disjoint;
1224
19
      isl_ast_graft *graft_j;
1225
19
1226
19
      if (j == first)
1227
2
        cmp = -1;
1228
17
      else
1229
17
        cmp = isl_set_plain_cmp(list1->p[j - 1]->guard,
1230
17
              graft->guard);
1231
19
      if (cmp > 0) {
1232
7
        disjoint = isl_set_is_disjoint(graft->guard,
1233
7
              list1->p[j - 1]->guard);
1234
7
        if (disjoint < 0) {
1235
0
          isl_ast_graft_free(graft);
1236
0
          list1 = isl_ast_graft_list_free(list1);
1237
0
          break;
1238
0
        }
1239
7
        if (!disjoint)
1240
5
          cmp = -1;
1241
7
      }
1242
19
      if (cmp > 0)
1243
2
        continue;
1244
17
      if (cmp < 0) {
1245
11
        list1 = isl_ast_graft_list_insert(list1, j,
1246
11
                graft);
1247
11
        break;
1248
11
      }
1249
6
1250
6
      --j;
1251
6
1252
6
      graft_j = isl_ast_graft_list_get_ast_graft(list1, j);
1253
6
      graft_j = isl_ast_graft_fuse(graft_j, graft, build);
1254
6
      list1 = isl_ast_graft_list_set_ast_graft(list1, j,
1255
6
                graft_j);
1256
6
      break;
1257
6
    }
1258
17
1259
17
    if (j < 0) {
1260
0
      isl_ast_graft_free(graft);
1261
0
      isl_die(isl_ast_build_get_ctx(build),
1262
0
        isl_error_internal,
1263
0
        "element failed to get inserted", break);
1264
0
    }
1265
17
1266
17
    first = j + 1;
1267
17
    if (!list1)
1268
0
      break;
1269
17
  }
1270
16
  if (i < list2->n)
1271
0
    list1 = isl_ast_graft_list_free(list1);
1272
16
  isl_ast_graft_list_free(list2);
1273
16
1274
16
  return list1;
1275
0
error:
1276
0
  isl_ast_graft_list_free(list1);
1277
0
  isl_ast_graft_list_free(list2);
1278
0
  return NULL;
1279
16
}
1280
1281
__isl_give isl_printer *isl_printer_print_ast_graft(__isl_take isl_printer *p,
1282
  __isl_keep isl_ast_graft *graft)
1283
0
{
1284
0
  if (!p)
1285
0
    return NULL;
1286
0
  if (!graft)
1287
0
    return isl_printer_free(p);
1288
0
1289
0
  p = isl_printer_print_str(p, "(");
1290
0
  p = isl_printer_print_str(p, "guard: ");
1291
0
  p = isl_printer_print_set(p, graft->guard);
1292
0
  p = isl_printer_print_str(p, ", ");
1293
0
  p = isl_printer_print_str(p, "enforced: ");
1294
0
  p = isl_printer_print_basic_set(p, graft->enforced);
1295
0
  p = isl_printer_print_str(p, ", ");
1296
0
  p = isl_printer_print_str(p, "node: ");
1297
0
  p = isl_printer_print_ast_node(p, graft->node);
1298
0
  p = isl_printer_print_str(p, ")");
1299
0
1300
0
  return p;
1301
0
}