Coverage Report

Created: 2017-10-03 07:32

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