2 * Copyright 2012-2013 Ecole Normale Superieure
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege,
7 * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
10 #include <isl_ast_private.h>
15 #include <isl_list_templ.c>
20 #include <isl_list_templ.c>
22 isl_ctx
*isl_ast_print_options_get_ctx(
23 __isl_keep isl_ast_print_options
*options
)
25 return options
? options
->ctx
: NULL
;
28 __isl_give isl_ast_print_options
*isl_ast_print_options_alloc(isl_ctx
*ctx
)
30 isl_ast_print_options
*options
;
32 options
= isl_calloc_type(ctx
, isl_ast_print_options
);
43 __isl_give isl_ast_print_options
*isl_ast_print_options_dup(
44 __isl_keep isl_ast_print_options
*options
)
47 isl_ast_print_options
*dup
;
52 ctx
= isl_ast_print_options_get_ctx(options
);
53 dup
= isl_ast_print_options_alloc(ctx
);
57 dup
->print_for
= options
->print_for
;
58 dup
->print_for_user
= options
->print_for_user
;
59 dup
->print_user
= options
->print_user
;
60 dup
->print_user_user
= options
->print_user_user
;
65 __isl_give isl_ast_print_options
*isl_ast_print_options_cow(
66 __isl_take isl_ast_print_options
*options
)
71 if (options
->ref
== 1)
74 return isl_ast_print_options_dup(options
);
77 __isl_give isl_ast_print_options
*isl_ast_print_options_copy(
78 __isl_keep isl_ast_print_options
*options
)
87 void *isl_ast_print_options_free(__isl_take isl_ast_print_options
*options
)
92 if (--options
->ref
> 0)
95 isl_ctx_deref(options
->ctx
);
101 /* Set the print_user callback of "options" to "print_user".
103 * If this callback is set, then it used to print user nodes in the AST.
104 * Otherwise, the expression associated to the user node is printed.
106 __isl_give isl_ast_print_options
*isl_ast_print_options_set_print_user(
107 __isl_take isl_ast_print_options
*options
,
108 __isl_give isl_printer
*(*print_user
)(__isl_take isl_printer
*p
,
109 __isl_take isl_ast_print_options
*options
,
110 __isl_keep isl_ast_node
*node
, void *user
),
113 options
= isl_ast_print_options_cow(options
);
117 options
->print_user
= print_user
;
118 options
->print_user_user
= user
;
123 /* Set the print_for callback of "options" to "print_for".
125 * If this callback is set, then it used to print for nodes in the AST.
127 __isl_give isl_ast_print_options
*isl_ast_print_options_set_print_for(
128 __isl_take isl_ast_print_options
*options
,
129 __isl_give isl_printer
*(*print_for
)(__isl_take isl_printer
*p
,
130 __isl_take isl_ast_print_options
*options
,
131 __isl_keep isl_ast_node
*node
, void *user
),
134 options
= isl_ast_print_options_cow(options
);
138 options
->print_for
= print_for
;
139 options
->print_for_user
= user
;
144 __isl_give isl_ast_expr
*isl_ast_expr_copy(__isl_keep isl_ast_expr
*expr
)
153 __isl_give isl_ast_expr
*isl_ast_expr_dup(__isl_keep isl_ast_expr
*expr
)
162 ctx
= isl_ast_expr_get_ctx(expr
);
163 switch (expr
->type
) {
164 case isl_ast_expr_int
:
165 dup
= isl_ast_expr_from_val(isl_val_copy(expr
->u
.v
));
167 case isl_ast_expr_id
:
168 dup
= isl_ast_expr_from_id(isl_id_copy(expr
->u
.id
));
170 case isl_ast_expr_op
:
171 dup
= isl_ast_expr_alloc_op(ctx
,
172 expr
->u
.op
.op
, expr
->u
.op
.n_arg
);
175 for (i
= 0; i
< expr
->u
.op
.n_arg
; ++i
)
177 isl_ast_expr_copy(expr
->u
.op
.args
[i
]);
179 case isl_ast_expr_error
:
189 __isl_give isl_ast_expr
*isl_ast_expr_cow(__isl_take isl_ast_expr
*expr
)
197 return isl_ast_expr_dup(expr
);
200 void *isl_ast_expr_free(__isl_take isl_ast_expr
*expr
)
210 isl_ctx_deref(expr
->ctx
);
212 switch (expr
->type
) {
213 case isl_ast_expr_int
:
214 isl_val_free(expr
->u
.v
);
216 case isl_ast_expr_id
:
217 isl_id_free(expr
->u
.id
);
219 case isl_ast_expr_op
:
220 for (i
= 0; i
< expr
->u
.op
.n_arg
; ++i
)
221 isl_ast_expr_free(expr
->u
.op
.args
[i
]);
222 free(expr
->u
.op
.args
);
224 case isl_ast_expr_error
:
232 isl_ctx
*isl_ast_expr_get_ctx(__isl_keep isl_ast_expr
*expr
)
234 return expr
? expr
->ctx
: NULL
;
237 enum isl_ast_expr_type
isl_ast_expr_get_type(__isl_keep isl_ast_expr
*expr
)
239 return expr
? expr
->type
: isl_ast_expr_error
;
242 /* Return the integer value represented by "expr".
244 __isl_give isl_val
*isl_ast_expr_get_val(__isl_keep isl_ast_expr
*expr
)
248 if (expr
->type
!= isl_ast_expr_int
)
249 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
250 "expression not an int", return NULL
);
251 return isl_val_copy(expr
->u
.v
);
254 __isl_give isl_id
*isl_ast_expr_get_id(__isl_keep isl_ast_expr
*expr
)
258 if (expr
->type
!= isl_ast_expr_id
)
259 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
260 "expression not an identifier", return NULL
);
262 return isl_id_copy(expr
->u
.id
);
265 enum isl_ast_op_type
isl_ast_expr_get_op_type(__isl_keep isl_ast_expr
*expr
)
268 return isl_ast_op_error
;
269 if (expr
->type
!= isl_ast_expr_op
)
270 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
271 "expression not an operation", return isl_ast_op_error
);
272 return expr
->u
.op
.op
;
275 int isl_ast_expr_get_op_n_arg(__isl_keep isl_ast_expr
*expr
)
279 if (expr
->type
!= isl_ast_expr_op
)
280 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
281 "expression not an operation", return -1);
282 return expr
->u
.op
.n_arg
;
285 __isl_give isl_ast_expr
*isl_ast_expr_get_op_arg(__isl_keep isl_ast_expr
*expr
,
290 if (expr
->type
!= isl_ast_expr_op
)
291 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
292 "expression not an operation", return NULL
);
293 if (pos
< 0 || pos
>= expr
->u
.op
.n_arg
)
294 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
295 "index out of bounds", return NULL
);
297 return isl_ast_expr_copy(expr
->u
.op
.args
[pos
]);
300 /* Replace the argument at position "pos" of "expr" by "arg".
302 __isl_give isl_ast_expr
*isl_ast_expr_set_op_arg(__isl_take isl_ast_expr
*expr
,
303 int pos
, __isl_take isl_ast_expr
*arg
)
305 expr
= isl_ast_expr_cow(expr
);
308 if (expr
->type
!= isl_ast_expr_op
)
309 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
310 "expression not an operation", goto error
);
311 if (pos
< 0 || pos
>= expr
->u
.op
.n_arg
)
312 isl_die(isl_ast_expr_get_ctx(expr
), isl_error_invalid
,
313 "index out of bounds", goto error
);
315 isl_ast_expr_free(expr
->u
.op
.args
[pos
]);
316 expr
->u
.op
.args
[pos
] = arg
;
320 isl_ast_expr_free(arg
);
321 return isl_ast_expr_free(expr
);
324 /* Is "expr1" equal to "expr2"?
326 int isl_ast_expr_is_equal(__isl_keep isl_ast_expr
*expr1
,
327 __isl_keep isl_ast_expr
*expr2
)
331 if (!expr1
|| !expr2
)
336 if (expr1
->type
!= expr2
->type
)
338 switch (expr1
->type
) {
339 case isl_ast_expr_int
:
340 return isl_val_eq(expr1
->u
.v
, expr2
->u
.v
);
341 case isl_ast_expr_id
:
342 return expr1
->u
.id
== expr2
->u
.id
;
343 case isl_ast_expr_op
:
344 if (expr1
->u
.op
.op
!= expr2
->u
.op
.op
)
346 if (expr1
->u
.op
.n_arg
!= expr2
->u
.op
.n_arg
)
348 for (i
= 0; i
< expr1
->u
.op
.n_arg
; ++i
) {
350 equal
= isl_ast_expr_is_equal(expr1
->u
.op
.args
[i
],
351 expr2
->u
.op
.args
[i
]);
353 if (equal
< 0 || !equal
)
357 case isl_ast_expr_error
:
362 /* Create a new operation expression of operation type "op",
363 * with "n_arg" as yet unspecified arguments.
365 __isl_give isl_ast_expr
*isl_ast_expr_alloc_op(isl_ctx
*ctx
,
366 enum isl_ast_op_type op
, int n_arg
)
370 expr
= isl_calloc_type(ctx
, isl_ast_expr
);
377 expr
->type
= isl_ast_expr_op
;
379 expr
->u
.op
.n_arg
= n_arg
;
380 expr
->u
.op
.args
= isl_calloc_array(ctx
, isl_ast_expr
*, n_arg
);
382 if (n_arg
&& !expr
->u
.op
.args
)
383 return isl_ast_expr_free(expr
);
388 /* Create a new id expression representing "id".
390 __isl_give isl_ast_expr
*isl_ast_expr_from_id(__isl_take isl_id
*id
)
398 ctx
= isl_id_get_ctx(id
);
399 expr
= isl_calloc_type(ctx
, isl_ast_expr
);
401 return isl_id_free(id
);
406 expr
->type
= isl_ast_expr_id
;
412 /* Create a new integer expression representing "i".
414 __isl_give isl_ast_expr
*isl_ast_expr_alloc_int_si(isl_ctx
*ctx
, int i
)
418 expr
= isl_calloc_type(ctx
, isl_ast_expr
);
425 expr
->type
= isl_ast_expr_int
;
426 expr
->u
.v
= isl_val_int_from_si(ctx
, i
);
428 return isl_ast_expr_free(expr
);
433 /* Create a new integer expression representing "v".
435 __isl_give isl_ast_expr
*isl_ast_expr_from_val(__isl_take isl_val
*v
)
442 if (!isl_val_is_int(v
))
443 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
444 "expecting integer value", return isl_val_free(v
));
446 ctx
= isl_val_get_ctx(v
);
447 expr
= isl_calloc_type(ctx
, isl_ast_expr
);
449 return isl_val_free(v
);
454 expr
->type
= isl_ast_expr_int
;
460 /* Create an expression representing the negation of "arg".
462 __isl_give isl_ast_expr
*isl_ast_expr_neg(__isl_take isl_ast_expr
*arg
)
465 isl_ast_expr
*expr
= NULL
;
470 ctx
= isl_ast_expr_get_ctx(arg
);
471 expr
= isl_ast_expr_alloc_op(ctx
, isl_ast_op_minus
, 1);
475 expr
->u
.op
.args
[0] = arg
;
479 isl_ast_expr_free(arg
);
483 /* Create an expression representing the binary operation "type"
484 * applied to "expr1" and "expr2".
486 __isl_give isl_ast_expr
*isl_ast_expr_alloc_binary(enum isl_ast_op_type type
,
487 __isl_take isl_ast_expr
*expr1
, __isl_take isl_ast_expr
*expr2
)
490 isl_ast_expr
*expr
= NULL
;
492 if (!expr1
|| !expr2
)
495 ctx
= isl_ast_expr_get_ctx(expr1
);
496 expr
= isl_ast_expr_alloc_op(ctx
, type
, 2);
500 expr
->u
.op
.args
[0] = expr1
;
501 expr
->u
.op
.args
[1] = expr2
;
505 isl_ast_expr_free(expr1
);
506 isl_ast_expr_free(expr2
);
510 /* Create an expression representing the sum of "expr1" and "expr2".
512 __isl_give isl_ast_expr
*isl_ast_expr_add(__isl_take isl_ast_expr
*expr1
,
513 __isl_take isl_ast_expr
*expr2
)
515 return isl_ast_expr_alloc_binary(isl_ast_op_add
, expr1
, expr2
);
518 /* Create an expression representing the difference of "expr1" and "expr2".
520 __isl_give isl_ast_expr
*isl_ast_expr_sub(__isl_take isl_ast_expr
*expr1
,
521 __isl_take isl_ast_expr
*expr2
)
523 return isl_ast_expr_alloc_binary(isl_ast_op_sub
, expr1
, expr2
);
526 /* Create an expression representing the product of "expr1" and "expr2".
528 __isl_give isl_ast_expr
*isl_ast_expr_mul(__isl_take isl_ast_expr
*expr1
,
529 __isl_take isl_ast_expr
*expr2
)
531 return isl_ast_expr_alloc_binary(isl_ast_op_mul
, expr1
, expr2
);
534 /* Create an expression representing the quotient of "expr1" and "expr2".
536 __isl_give isl_ast_expr
*isl_ast_expr_div(__isl_take isl_ast_expr
*expr1
,
537 __isl_take isl_ast_expr
*expr2
)
539 return isl_ast_expr_alloc_binary(isl_ast_op_div
, expr1
, expr2
);
542 /* Create an expression representing the conjunction of "expr1" and "expr2".
544 __isl_give isl_ast_expr
*isl_ast_expr_and(__isl_take isl_ast_expr
*expr1
,
545 __isl_take isl_ast_expr
*expr2
)
547 return isl_ast_expr_alloc_binary(isl_ast_op_and
, expr1
, expr2
);
550 /* Create an expression representing the disjunction of "expr1" and "expr2".
552 __isl_give isl_ast_expr
*isl_ast_expr_or(__isl_take isl_ast_expr
*expr1
,
553 __isl_take isl_ast_expr
*expr2
)
555 return isl_ast_expr_alloc_binary(isl_ast_op_or
, expr1
, expr2
);
558 isl_ctx
*isl_ast_node_get_ctx(__isl_keep isl_ast_node
*node
)
560 return node
? node
->ctx
: NULL
;
563 enum isl_ast_node_type
isl_ast_node_get_type(__isl_keep isl_ast_node
*node
)
565 return node
? node
->type
: isl_ast_node_error
;
568 __isl_give isl_ast_node
*isl_ast_node_alloc(isl_ctx
*ctx
,
569 enum isl_ast_node_type type
)
573 node
= isl_calloc_type(ctx
, isl_ast_node
);
585 /* Create an if node with the given guard.
587 * The then body needs to be filled in later.
589 __isl_give isl_ast_node
*isl_ast_node_alloc_if(__isl_take isl_ast_expr
*guard
)
596 node
= isl_ast_node_alloc(isl_ast_expr_get_ctx(guard
), isl_ast_node_if
);
599 node
->u
.i
.guard
= guard
;
603 isl_ast_expr_free(guard
);
607 /* Create a for node with the given iterator.
609 * The remaining fields need to be filled in later.
611 __isl_give isl_ast_node
*isl_ast_node_alloc_for(__isl_take isl_id
*id
)
619 ctx
= isl_id_get_ctx(id
);
620 node
= isl_ast_node_alloc(ctx
, isl_ast_node_for
);
624 node
->u
.f
.iterator
= isl_ast_expr_from_id(id
);
625 if (!node
->u
.f
.iterator
)
626 return isl_ast_node_free(node
);
631 /* Create a user node evaluating "expr".
633 __isl_give isl_ast_node
*isl_ast_node_alloc_user(__isl_take isl_ast_expr
*expr
)
641 ctx
= isl_ast_expr_get_ctx(expr
);
642 node
= isl_ast_node_alloc(ctx
, isl_ast_node_user
);
646 node
->u
.e
.expr
= expr
;
650 isl_ast_expr_free(expr
);
654 /* Create a block node with the given children.
656 __isl_give isl_ast_node
*isl_ast_node_alloc_block(
657 __isl_take isl_ast_node_list
*list
)
665 ctx
= isl_ast_node_list_get_ctx(list
);
666 node
= isl_ast_node_alloc(ctx
, isl_ast_node_block
);
670 node
->u
.b
.children
= list
;
674 isl_ast_node_list_free(list
);
678 /* Represent the given list of nodes as a single node, either by
679 * extract the node from a single element list or by creating
680 * a block node with the list of nodes as children.
682 __isl_give isl_ast_node
*isl_ast_node_from_ast_node_list(
683 __isl_take isl_ast_node_list
*list
)
687 if (isl_ast_node_list_n_ast_node(list
) != 1)
688 return isl_ast_node_alloc_block(list
);
690 node
= isl_ast_node_list_get_ast_node(list
, 0);
691 isl_ast_node_list_free(list
);
696 __isl_give isl_ast_node
*isl_ast_node_copy(__isl_keep isl_ast_node
*node
)
705 __isl_give isl_ast_node
*isl_ast_node_dup(__isl_keep isl_ast_node
*node
)
712 dup
= isl_ast_node_alloc(isl_ast_node_get_ctx(node
), node
->type
);
716 switch (node
->type
) {
717 case isl_ast_node_if
:
718 dup
->u
.i
.guard
= isl_ast_expr_copy(node
->u
.i
.guard
);
719 dup
->u
.i
.then
= isl_ast_node_copy(node
->u
.i
.then
);
720 dup
->u
.i
.else_node
= isl_ast_node_copy(node
->u
.i
.else_node
);
721 if (!dup
->u
.i
.guard
|| !dup
->u
.i
.then
||
722 (node
->u
.i
.else_node
&& !dup
->u
.i
.else_node
))
723 return isl_ast_node_free(dup
);
725 case isl_ast_node_for
:
726 dup
->u
.f
.iterator
= isl_ast_expr_copy(node
->u
.f
.iterator
);
727 dup
->u
.f
.init
= isl_ast_expr_copy(node
->u
.f
.init
);
728 dup
->u
.f
.cond
= isl_ast_expr_copy(node
->u
.f
.cond
);
729 dup
->u
.f
.inc
= isl_ast_expr_copy(node
->u
.f
.inc
);
730 dup
->u
.f
.body
= isl_ast_node_copy(node
->u
.f
.body
);
731 if (!dup
->u
.f
.iterator
|| !dup
->u
.f
.init
|| !dup
->u
.f
.cond
||
732 !dup
->u
.f
.inc
|| !dup
->u
.f
.body
)
733 return isl_ast_node_free(dup
);
735 case isl_ast_node_block
:
736 dup
->u
.b
.children
= isl_ast_node_list_copy(node
->u
.b
.children
);
737 if (!dup
->u
.b
.children
)
738 return isl_ast_node_free(dup
);
740 case isl_ast_node_user
:
741 dup
->u
.e
.expr
= isl_ast_expr_copy(node
->u
.e
.expr
);
743 return isl_ast_node_free(dup
);
745 case isl_ast_node_error
:
752 __isl_give isl_ast_node
*isl_ast_node_cow(__isl_take isl_ast_node
*node
)
760 return isl_ast_node_dup(node
);
763 void *isl_ast_node_free(__isl_take isl_ast_node
*node
)
771 switch (node
->type
) {
772 case isl_ast_node_if
:
773 isl_ast_expr_free(node
->u
.i
.guard
);
774 isl_ast_node_free(node
->u
.i
.then
);
775 isl_ast_node_free(node
->u
.i
.else_node
);
777 case isl_ast_node_for
:
778 isl_ast_expr_free(node
->u
.f
.iterator
);
779 isl_ast_expr_free(node
->u
.f
.init
);
780 isl_ast_expr_free(node
->u
.f
.cond
);
781 isl_ast_expr_free(node
->u
.f
.inc
);
782 isl_ast_node_free(node
->u
.f
.body
);
784 case isl_ast_node_block
:
785 isl_ast_node_list_free(node
->u
.b
.children
);
787 case isl_ast_node_user
:
788 isl_ast_expr_free(node
->u
.e
.expr
);
790 case isl_ast_node_error
:
794 isl_id_free(node
->annotation
);
795 isl_ctx_deref(node
->ctx
);
801 /* Replace the body of the for node "node" by "body".
803 __isl_give isl_ast_node
*isl_ast_node_for_set_body(
804 __isl_take isl_ast_node
*node
, __isl_take isl_ast_node
*body
)
806 node
= isl_ast_node_cow(node
);
809 if (node
->type
!= isl_ast_node_for
)
810 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
811 "not a for node", goto error
);
813 isl_ast_node_free(node
->u
.f
.body
);
814 node
->u
.f
.body
= body
;
818 isl_ast_node_free(node
);
819 isl_ast_node_free(body
);
823 __isl_give isl_ast_node
*isl_ast_node_for_get_body(
824 __isl_keep isl_ast_node
*node
)
828 if (node
->type
!= isl_ast_node_for
)
829 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
830 "not a for node", return NULL
);
831 return isl_ast_node_copy(node
->u
.f
.body
);
834 /* Mark the given for node as being degenerate.
836 __isl_give isl_ast_node
*isl_ast_node_for_mark_degenerate(
837 __isl_take isl_ast_node
*node
)
839 node
= isl_ast_node_cow(node
);
842 node
->u
.f
.degenerate
= 1;
846 int isl_ast_node_for_is_degenerate(__isl_keep isl_ast_node
*node
)
850 if (node
->type
!= isl_ast_node_for
)
851 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
852 "not a for node", return -1);
853 return node
->u
.f
.degenerate
;
856 __isl_give isl_ast_expr
*isl_ast_node_for_get_iterator(
857 __isl_keep isl_ast_node
*node
)
861 if (node
->type
!= isl_ast_node_for
)
862 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
863 "not a for node", return NULL
);
864 return isl_ast_expr_copy(node
->u
.f
.iterator
);
867 __isl_give isl_ast_expr
*isl_ast_node_for_get_init(
868 __isl_keep isl_ast_node
*node
)
872 if (node
->type
!= isl_ast_node_for
)
873 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
874 "not a for node", return NULL
);
875 return isl_ast_expr_copy(node
->u
.f
.init
);
878 /* Return the condition expression of the given for node.
880 * If the for node is degenerate, then the condition is not explicitly
881 * stored in the node. Instead, it is constructed as
885 __isl_give isl_ast_expr
*isl_ast_node_for_get_cond(
886 __isl_keep isl_ast_node
*node
)
890 if (node
->type
!= isl_ast_node_for
)
891 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
892 "not a for node", return NULL
);
893 if (!node
->u
.f
.degenerate
)
894 return isl_ast_expr_copy(node
->u
.f
.cond
);
896 return isl_ast_expr_alloc_binary(isl_ast_op_le
,
897 isl_ast_expr_copy(node
->u
.f
.iterator
),
898 isl_ast_expr_copy(node
->u
.f
.init
));
901 /* Return the increment of the given for node.
903 * If the for node is degenerate, then the increment is not explicitly
904 * stored in the node. We simply return "1".
906 __isl_give isl_ast_expr
*isl_ast_node_for_get_inc(
907 __isl_keep isl_ast_node
*node
)
911 if (node
->type
!= isl_ast_node_for
)
912 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
913 "not a for node", return NULL
);
914 if (!node
->u
.f
.degenerate
)
915 return isl_ast_expr_copy(node
->u
.f
.inc
);
916 return isl_ast_expr_alloc_int_si(isl_ast_node_get_ctx(node
), 1);
919 /* Replace the then branch of the if node "node" by "child".
921 __isl_give isl_ast_node
*isl_ast_node_if_set_then(
922 __isl_take isl_ast_node
*node
, __isl_take isl_ast_node
*child
)
924 node
= isl_ast_node_cow(node
);
927 if (node
->type
!= isl_ast_node_if
)
928 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
929 "not an if node", goto error
);
931 isl_ast_node_free(node
->u
.i
.then
);
932 node
->u
.i
.then
= child
;
936 isl_ast_node_free(node
);
937 isl_ast_node_free(child
);
941 __isl_give isl_ast_node
*isl_ast_node_if_get_then(
942 __isl_keep isl_ast_node
*node
)
946 if (node
->type
!= isl_ast_node_if
)
947 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
948 "not an if node", return NULL
);
949 return isl_ast_node_copy(node
->u
.i
.then
);
952 int isl_ast_node_if_has_else(
953 __isl_keep isl_ast_node
*node
)
957 if (node
->type
!= isl_ast_node_if
)
958 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
959 "not an if node", return -1);
960 return node
->u
.i
.else_node
!= NULL
;
963 __isl_give isl_ast_node
*isl_ast_node_if_get_else(
964 __isl_keep isl_ast_node
*node
)
968 if (node
->type
!= isl_ast_node_if
)
969 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
970 "not an if node", return NULL
);
971 return isl_ast_node_copy(node
->u
.i
.else_node
);
974 __isl_give isl_ast_expr
*isl_ast_node_if_get_cond(
975 __isl_keep isl_ast_node
*node
)
979 if (node
->type
!= isl_ast_node_if
)
980 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
981 "not a guard node", return NULL
);
982 return isl_ast_expr_copy(node
->u
.i
.guard
);
985 __isl_give isl_ast_node_list
*isl_ast_node_block_get_children(
986 __isl_keep isl_ast_node
*node
)
990 if (node
->type
!= isl_ast_node_block
)
991 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
992 "not a block node", return NULL
);
993 return isl_ast_node_list_copy(node
->u
.b
.children
);
996 __isl_give isl_ast_expr
*isl_ast_node_user_get_expr(
997 __isl_keep isl_ast_node
*node
)
1002 return isl_ast_expr_copy(node
->u
.e
.expr
);
1005 __isl_give isl_id
*isl_ast_node_get_annotation(__isl_keep isl_ast_node
*node
)
1007 return node
? isl_id_copy(node
->annotation
) : NULL
;
1010 /* Replace node->annotation by "annotation".
1012 __isl_give isl_ast_node
*isl_ast_node_set_annotation(
1013 __isl_take isl_ast_node
*node
, __isl_take isl_id
*annotation
)
1015 node
= isl_ast_node_cow(node
);
1016 if (!node
|| !annotation
)
1019 isl_id_free(node
->annotation
);
1020 node
->annotation
= annotation
;
1024 isl_id_free(annotation
);
1025 return isl_ast_node_free(node
);
1028 /* Textual C representation of the various operators.
1030 static char *op_str
[] = {
1031 [isl_ast_op_and
] = "&&",
1032 [isl_ast_op_and_then
] = "&&",
1033 [isl_ast_op_or
] = "||",
1034 [isl_ast_op_or_else
] = "||",
1035 [isl_ast_op_max
] = "max",
1036 [isl_ast_op_min
] = "min",
1037 [isl_ast_op_minus
] = "-",
1038 [isl_ast_op_add
] = "+",
1039 [isl_ast_op_sub
] = "-",
1040 [isl_ast_op_mul
] = "*",
1041 [isl_ast_op_pdiv_q
] = "/",
1042 [isl_ast_op_pdiv_r
] = "%",
1043 [isl_ast_op_div
] = "/",
1044 [isl_ast_op_eq
] = "==",
1045 [isl_ast_op_le
] = "<=",
1046 [isl_ast_op_ge
] = ">=",
1047 [isl_ast_op_lt
] = "<",
1048 [isl_ast_op_gt
] = ">"
1051 /* Precedence in C of the various operators.
1052 * Based on http://en.wikipedia.org/wiki/Operators_in_C_and_C++
1053 * Lowest value means highest precedence.
1055 static int op_prec
[] = {
1056 [isl_ast_op_and
] = 13,
1057 [isl_ast_op_and_then
] = 13,
1058 [isl_ast_op_or
] = 14,
1059 [isl_ast_op_or_else
] = 14,
1060 [isl_ast_op_max
] = 2,
1061 [isl_ast_op_min
] = 2,
1062 [isl_ast_op_minus
] = 3,
1063 [isl_ast_op_add
] = 6,
1064 [isl_ast_op_sub
] = 6,
1065 [isl_ast_op_mul
] = 5,
1066 [isl_ast_op_div
] = 5,
1067 [isl_ast_op_fdiv_q
] = 2,
1068 [isl_ast_op_pdiv_q
] = 5,
1069 [isl_ast_op_pdiv_r
] = 5,
1070 [isl_ast_op_cond
] = 15,
1071 [isl_ast_op_select
] = 15,
1072 [isl_ast_op_eq
] = 9,
1073 [isl_ast_op_le
] = 8,
1074 [isl_ast_op_ge
] = 8,
1075 [isl_ast_op_lt
] = 8,
1076 [isl_ast_op_gt
] = 8,
1077 [isl_ast_op_call
] = 2,
1078 [isl_ast_op_access
] = 2
1081 /* Is the operator left-to-right associative?
1083 static int op_left
[] = {
1084 [isl_ast_op_and
] = 1,
1085 [isl_ast_op_and_then
] = 1,
1086 [isl_ast_op_or
] = 1,
1087 [isl_ast_op_or_else
] = 1,
1088 [isl_ast_op_max
] = 1,
1089 [isl_ast_op_min
] = 1,
1090 [isl_ast_op_minus
] = 0,
1091 [isl_ast_op_add
] = 1,
1092 [isl_ast_op_sub
] = 1,
1093 [isl_ast_op_mul
] = 1,
1094 [isl_ast_op_div
] = 1,
1095 [isl_ast_op_fdiv_q
] = 1,
1096 [isl_ast_op_pdiv_q
] = 1,
1097 [isl_ast_op_pdiv_r
] = 1,
1098 [isl_ast_op_cond
] = 0,
1099 [isl_ast_op_select
] = 0,
1100 [isl_ast_op_eq
] = 1,
1101 [isl_ast_op_le
] = 1,
1102 [isl_ast_op_ge
] = 1,
1103 [isl_ast_op_lt
] = 1,
1104 [isl_ast_op_gt
] = 1,
1105 [isl_ast_op_call
] = 1,
1106 [isl_ast_op_access
] = 1
1109 static int is_and(enum isl_ast_op_type op
)
1111 return op
== isl_ast_op_and
|| op
== isl_ast_op_and_then
;
1114 static int is_or(enum isl_ast_op_type op
)
1116 return op
== isl_ast_op_or
|| op
== isl_ast_op_or_else
;
1119 static int is_add_sub(enum isl_ast_op_type op
)
1121 return op
== isl_ast_op_add
|| op
== isl_ast_op_sub
;
1124 static int is_div_mod(enum isl_ast_op_type op
)
1126 return op
== isl_ast_op_div
|| op
== isl_ast_op_pdiv_r
;
1129 /* Do we need/want parentheses around "expr" as a subexpression of
1130 * an "op" operation? If "left" is set, then "expr" is the left-most
1133 * We only need parentheses if "expr" represents an operation.
1135 * If op has a higher precedence than expr->u.op.op, then we need
1137 * If op and expr->u.op.op have the same precedence, but the operations
1138 * are performed in an order that is different from the associativity,
1139 * then we need parentheses.
1141 * An and inside an or technically does not require parentheses,
1142 * but some compilers complain about that, so we add them anyway.
1144 * Computations such as "a / b * c" and "a % b + c" can be somewhat
1145 * difficult to read, so we add parentheses for those as well.
1147 static int sub_expr_need_parens(enum isl_ast_op_type op
,
1148 __isl_keep isl_ast_expr
*expr
, int left
)
1150 if (expr
->type
!= isl_ast_expr_op
)
1153 if (op_prec
[expr
->u
.op
.op
] > op_prec
[op
])
1155 if (op_prec
[expr
->u
.op
.op
] == op_prec
[op
] && left
!= op_left
[op
])
1158 if (is_or(op
) && is_and(expr
->u
.op
.op
))
1160 if (op
== isl_ast_op_mul
&& expr
->u
.op
.op
!= isl_ast_op_mul
&&
1161 op_prec
[expr
->u
.op
.op
] == op_prec
[op
])
1163 if (is_add_sub(op
) && is_div_mod(expr
->u
.op
.op
))
1169 /* Print "expr" as a subexpression of an "op" operation.
1170 * If "left" is set, then "expr" is the left-most operand.
1172 static __isl_give isl_printer
*print_sub_expr(__isl_take isl_printer
*p
,
1173 enum isl_ast_op_type op
, __isl_keep isl_ast_expr
*expr
, int left
)
1177 need_parens
= sub_expr_need_parens(op
, expr
, left
);
1180 p
= isl_printer_print_str(p
, "(");
1181 p
= isl_printer_print_ast_expr(p
, expr
);
1183 p
= isl_printer_print_str(p
, ")");
1187 /* Print a min or max reduction "expr".
1189 static __isl_give isl_printer
*print_min_max(__isl_take isl_printer
*p
,
1190 __isl_keep isl_ast_expr
*expr
)
1194 for (i
= 1; i
< expr
->u
.op
.n_arg
; ++i
) {
1195 p
= isl_printer_print_str(p
, op_str
[expr
->u
.op
.op
]);
1196 p
= isl_printer_print_str(p
, "(");
1198 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[0]);
1199 for (i
= 1; i
< expr
->u
.op
.n_arg
; ++i
) {
1200 p
= isl_printer_print_str(p
, ", ");
1201 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[i
]);
1202 p
= isl_printer_print_str(p
, ")");
1208 /* Print a function call "expr".
1210 * The first argument represents the function to be called.
1212 static __isl_give isl_printer
*print_call(__isl_take isl_printer
*p
,
1213 __isl_keep isl_ast_expr
*expr
)
1217 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[0]);
1218 p
= isl_printer_print_str(p
, "(");
1219 for (i
= 1; i
< expr
->u
.op
.n_arg
; ++i
) {
1221 p
= isl_printer_print_str(p
, ", ");
1222 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[i
]);
1224 p
= isl_printer_print_str(p
, ")");
1229 /* Print an array access "expr".
1231 * The first argument represents the array being accessed.
1233 static __isl_give isl_printer
*print_access(__isl_take isl_printer
*p
,
1234 __isl_keep isl_ast_expr
*expr
)
1238 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[0]);
1239 for (i
= 1; i
< expr
->u
.op
.n_arg
; ++i
) {
1240 p
= isl_printer_print_str(p
, "[");
1241 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[i
]);
1242 p
= isl_printer_print_str(p
, "]");
1248 /* Print "expr" to "p".
1250 * If we are printing in isl format, then we also print an indication
1251 * of the size of the expression (if it was computed).
1253 __isl_give isl_printer
*isl_printer_print_ast_expr(__isl_take isl_printer
*p
,
1254 __isl_keep isl_ast_expr
*expr
)
1259 return isl_printer_free(p
);
1261 switch (expr
->type
) {
1262 case isl_ast_expr_op
:
1263 if (expr
->u
.op
.op
== isl_ast_op_call
) {
1264 p
= print_call(p
, expr
);
1267 if (expr
->u
.op
.op
== isl_ast_op_access
) {
1268 p
= print_access(p
, expr
);
1271 if (expr
->u
.op
.n_arg
== 1) {
1272 p
= isl_printer_print_str(p
, op_str
[expr
->u
.op
.op
]);
1273 p
= print_sub_expr(p
, expr
->u
.op
.op
,
1274 expr
->u
.op
.args
[0], 0);
1277 if (expr
->u
.op
.op
== isl_ast_op_fdiv_q
) {
1278 p
= isl_printer_print_str(p
, "floord(");
1279 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[0]);
1280 p
= isl_printer_print_str(p
, ", ");
1281 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[1]);
1282 p
= isl_printer_print_str(p
, ")");
1285 if (expr
->u
.op
.op
== isl_ast_op_max
||
1286 expr
->u
.op
.op
== isl_ast_op_min
) {
1287 p
= print_min_max(p
, expr
);
1290 if (expr
->u
.op
.op
== isl_ast_op_cond
||
1291 expr
->u
.op
.op
== isl_ast_op_select
) {
1292 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[0]);
1293 p
= isl_printer_print_str(p
, " ? ");
1294 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[1]);
1295 p
= isl_printer_print_str(p
, " : ");
1296 p
= isl_printer_print_ast_expr(p
, expr
->u
.op
.args
[2]);
1299 if (expr
->u
.op
.n_arg
!= 2)
1300 isl_die(isl_printer_get_ctx(p
), isl_error_internal
,
1301 "operation should have two arguments",
1303 p
= print_sub_expr(p
, expr
->u
.op
.op
, expr
->u
.op
.args
[0], 1);
1304 p
= isl_printer_print_str(p
, " ");
1305 p
= isl_printer_print_str(p
, op_str
[expr
->u
.op
.op
]);
1306 p
= isl_printer_print_str(p
, " ");
1307 p
= print_sub_expr(p
, expr
->u
.op
.op
, expr
->u
.op
.args
[1], 0);
1309 case isl_ast_expr_id
:
1310 p
= isl_printer_print_str(p
, isl_id_get_name(expr
->u
.id
));
1312 case isl_ast_expr_int
:
1313 p
= isl_printer_print_val(p
, expr
->u
.v
);
1315 case isl_ast_expr_error
:
1321 isl_printer_free(p
);
1325 /* Print "node" to "p" in "isl format".
1327 static __isl_give isl_printer
*print_ast_node_isl(__isl_take isl_printer
*p
,
1328 __isl_keep isl_ast_node
*node
)
1330 p
= isl_printer_print_str(p
, "(");
1331 switch (node
->type
) {
1332 case isl_ast_node_for
:
1333 if (node
->u
.f
.degenerate
) {
1334 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.init
);
1336 p
= isl_printer_print_str(p
, "init: ");
1337 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.init
);
1338 p
= isl_printer_print_str(p
, ", ");
1339 p
= isl_printer_print_str(p
, "cond: ");
1340 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.cond
);
1341 p
= isl_printer_print_str(p
, ", ");
1342 p
= isl_printer_print_str(p
, "inc: ");
1343 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.inc
);
1345 if (node
->u
.f
.body
) {
1346 p
= isl_printer_print_str(p
, ", ");
1347 p
= isl_printer_print_str(p
, "body: ");
1348 p
= isl_printer_print_ast_node(p
, node
->u
.f
.body
);
1351 case isl_ast_node_user
:
1352 p
= isl_printer_print_ast_expr(p
, node
->u
.e
.expr
);
1354 case isl_ast_node_if
:
1355 p
= isl_printer_print_str(p
, "guard: ");
1356 p
= isl_printer_print_ast_expr(p
, node
->u
.i
.guard
);
1357 if (node
->u
.i
.then
) {
1358 p
= isl_printer_print_str(p
, ", ");
1359 p
= isl_printer_print_str(p
, "then: ");
1360 p
= isl_printer_print_ast_node(p
, node
->u
.i
.then
);
1362 if (node
->u
.i
.else_node
) {
1363 p
= isl_printer_print_str(p
, ", ");
1364 p
= isl_printer_print_str(p
, "else: ");
1365 p
= isl_printer_print_ast_node(p
, node
->u
.i
.else_node
);
1368 case isl_ast_node_block
:
1369 p
= isl_printer_print_ast_node_list(p
, node
->u
.b
.children
);
1374 p
= isl_printer_print_str(p
, ")");
1378 /* Do we need to print a block around the body "node" of a for or if node?
1380 * If the node is a block, then we need to print a block.
1381 * Also if the node is a degenerate for then we will print it as
1382 * an assignment followed by the body of the for loop, so we need a block
1385 static int need_block(__isl_keep isl_ast_node
*node
)
1387 if (node
->type
== isl_ast_node_block
)
1389 if (node
->type
== isl_ast_node_for
&& node
->u
.f
.degenerate
)
1394 static __isl_give isl_printer
*print_ast_node_c(__isl_take isl_printer
*p
,
1395 __isl_keep isl_ast_node
*node
,
1396 __isl_keep isl_ast_print_options
*options
, int in_block
, int in_list
);
1397 static __isl_give isl_printer
*print_if_c(__isl_take isl_printer
*p
,
1398 __isl_keep isl_ast_node
*node
,
1399 __isl_keep isl_ast_print_options
*options
, int new_line
);
1401 /* Print the body "node" of a for or if node.
1402 * If "else_node" is set, then it is printed as well.
1404 * We first check if we need to print out a block.
1405 * We always print out a block if there is an else node to make
1406 * sure that the else node is matched to the correct if node.
1408 * If the else node is itself an if, then we print it as
1412 * Otherwise the else node is printed as
1417 static __isl_give isl_printer
*print_body_c(__isl_take isl_printer
*p
,
1418 __isl_keep isl_ast_node
*node
, __isl_keep isl_ast_node
*else_node
,
1419 __isl_keep isl_ast_print_options
*options
)
1422 return isl_printer_free(p
);
1424 if (!else_node
&& !need_block(node
)) {
1425 p
= isl_printer_end_line(p
);
1426 p
= isl_printer_indent(p
, 2);
1427 p
= isl_ast_node_print(node
, p
,
1428 isl_ast_print_options_copy(options
));
1429 p
= isl_printer_indent(p
, -2);
1433 p
= isl_printer_print_str(p
, " {");
1434 p
= isl_printer_end_line(p
);
1435 p
= isl_printer_indent(p
, 2);
1436 p
= print_ast_node_c(p
, node
, options
, 1, 0);
1437 p
= isl_printer_indent(p
, -2);
1438 p
= isl_printer_start_line(p
);
1439 p
= isl_printer_print_str(p
, "}");
1441 if (else_node
->type
== isl_ast_node_if
) {
1442 p
= isl_printer_print_str(p
, " else ");
1443 p
= print_if_c(p
, else_node
, options
, 0);
1445 p
= isl_printer_print_str(p
, " else");
1446 p
= print_body_c(p
, else_node
, NULL
, options
);
1449 p
= isl_printer_end_line(p
);
1454 /* Print the start of a compound statement.
1456 static __isl_give isl_printer
*start_block(__isl_take isl_printer
*p
)
1458 p
= isl_printer_start_line(p
);
1459 p
= isl_printer_print_str(p
, "{");
1460 p
= isl_printer_end_line(p
);
1461 p
= isl_printer_indent(p
, 2);
1466 /* Print the end of a compound statement.
1468 static __isl_give isl_printer
*end_block(__isl_take isl_printer
*p
)
1470 p
= isl_printer_indent(p
, -2);
1471 p
= isl_printer_start_line(p
);
1472 p
= isl_printer_print_str(p
, "}");
1473 p
= isl_printer_end_line(p
);
1478 /* Print the for node "node".
1480 * If the for node is degenerate, it is printed as
1482 * type iterator = init;
1485 * Otherwise, it is printed as
1487 * for (type iterator = init; cond; iterator += inc)
1490 * "in_block" is set if we are currently inside a block.
1491 * "in_list" is set if the current node is not alone in the block.
1492 * If we are not in a block or if the current not is not alone in the block
1493 * then we print a block around a degenerate for loop such that the variable
1494 * declaration will not conflict with any potential other declaration
1495 * of the same variable.
1497 static __isl_give isl_printer
*print_for_c(__isl_take isl_printer
*p
,
1498 __isl_keep isl_ast_node
*node
,
1499 __isl_keep isl_ast_print_options
*options
, int in_block
, int in_list
)
1505 type
= isl_options_get_ast_iterator_type(isl_printer_get_ctx(p
));
1506 if (!node
->u
.f
.degenerate
) {
1507 id
= isl_ast_expr_get_id(node
->u
.f
.iterator
);
1508 name
= isl_id_get_name(id
);
1510 p
= isl_printer_start_line(p
);
1511 p
= isl_printer_print_str(p
, "for (");
1512 p
= isl_printer_print_str(p
, type
);
1513 p
= isl_printer_print_str(p
, " ");
1514 p
= isl_printer_print_str(p
, name
);
1515 p
= isl_printer_print_str(p
, " = ");
1516 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.init
);
1517 p
= isl_printer_print_str(p
, "; ");
1518 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.cond
);
1519 p
= isl_printer_print_str(p
, "; ");
1520 p
= isl_printer_print_str(p
, name
);
1521 p
= isl_printer_print_str(p
, " += ");
1522 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.inc
);
1523 p
= isl_printer_print_str(p
, ")");
1524 p
= print_body_c(p
, node
->u
.f
.body
, NULL
, options
);
1526 id
= isl_ast_expr_get_id(node
->u
.f
.iterator
);
1527 name
= isl_id_get_name(id
);
1529 if (!in_block
|| in_list
)
1531 p
= isl_printer_start_line(p
);
1532 p
= isl_printer_print_str(p
, type
);
1533 p
= isl_printer_print_str(p
, " ");
1534 p
= isl_printer_print_str(p
, name
);
1535 p
= isl_printer_print_str(p
, " = ");
1536 p
= isl_printer_print_ast_expr(p
, node
->u
.f
.init
);
1537 p
= isl_printer_print_str(p
, ";");
1538 p
= isl_printer_end_line(p
);
1539 p
= print_ast_node_c(p
, node
->u
.f
.body
, options
, 1, 0);
1540 if (!in_block
|| in_list
)
1547 /* Print the if node "node".
1548 * If "new_line" is set then the if node should be printed on a new line.
1550 static __isl_give isl_printer
*print_if_c(__isl_take isl_printer
*p
,
1551 __isl_keep isl_ast_node
*node
,
1552 __isl_keep isl_ast_print_options
*options
, int new_line
)
1555 p
= isl_printer_start_line(p
);
1556 p
= isl_printer_print_str(p
, "if (");
1557 p
= isl_printer_print_ast_expr(p
, node
->u
.i
.guard
);
1558 p
= isl_printer_print_str(p
, ")");
1559 p
= print_body_c(p
, node
->u
.i
.then
, node
->u
.i
.else_node
, options
);
1564 /* Print the "node" to "p".
1566 * "in_block" is set if we are currently inside a block.
1567 * If so, we do not print a block around the children of a block node.
1568 * We do this to avoid an extra block around the body of a degenerate
1571 * "in_list" is set if the current node is not alone in the block.
1573 static __isl_give isl_printer
*print_ast_node_c(__isl_take isl_printer
*p
,
1574 __isl_keep isl_ast_node
*node
,
1575 __isl_keep isl_ast_print_options
*options
, int in_block
, int in_list
)
1577 switch (node
->type
) {
1578 case isl_ast_node_for
:
1579 if (options
->print_for
)
1580 return options
->print_for(p
,
1581 isl_ast_print_options_copy(options
),
1582 node
, options
->print_for_user
);
1583 p
= print_for_c(p
, node
, options
, in_block
, in_list
);
1585 case isl_ast_node_if
:
1586 p
= print_if_c(p
, node
, options
, 1);
1588 case isl_ast_node_block
:
1591 p
= isl_ast_node_list_print(node
->u
.b
.children
, p
, options
);
1595 case isl_ast_node_user
:
1596 if (options
->print_user
)
1597 return options
->print_user(p
,
1598 isl_ast_print_options_copy(options
),
1599 node
, options
->print_user_user
);
1600 p
= isl_printer_start_line(p
);
1601 p
= isl_printer_print_ast_expr(p
, node
->u
.e
.expr
);
1602 p
= isl_printer_print_str(p
, ";");
1603 p
= isl_printer_end_line(p
);
1605 case isl_ast_node_error
:
1611 /* Print the for node "node" to "p".
1613 __isl_give isl_printer
*isl_ast_node_for_print(__isl_keep isl_ast_node
*node
,
1614 __isl_take isl_printer
*p
, __isl_take isl_ast_print_options
*options
)
1616 if (!node
|| !options
)
1618 if (node
->type
!= isl_ast_node_for
)
1619 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
1620 "not a for node", goto error
);
1621 p
= print_for_c(p
, node
, options
, 0, 0);
1622 isl_ast_print_options_free(options
);
1625 isl_ast_print_options_free(options
);
1626 isl_printer_free(p
);
1630 /* Print the if node "node" to "p".
1632 __isl_give isl_printer
*isl_ast_node_if_print(__isl_keep isl_ast_node
*node
,
1633 __isl_take isl_printer
*p
, __isl_take isl_ast_print_options
*options
)
1635 if (!node
|| !options
)
1637 if (node
->type
!= isl_ast_node_if
)
1638 isl_die(isl_ast_node_get_ctx(node
), isl_error_invalid
,
1639 "not an if node", goto error
);
1640 p
= print_if_c(p
, node
, options
, 1);
1641 isl_ast_print_options_free(options
);
1644 isl_ast_print_options_free(options
);
1645 isl_printer_free(p
);
1649 /* Print "node" to "p".
1651 __isl_give isl_printer
*isl_ast_node_print(__isl_keep isl_ast_node
*node
,
1652 __isl_take isl_printer
*p
, __isl_take isl_ast_print_options
*options
)
1654 if (!options
|| !node
)
1656 p
= print_ast_node_c(p
, node
, options
, 0, 0);
1657 isl_ast_print_options_free(options
);
1660 isl_ast_print_options_free(options
);
1661 isl_printer_free(p
);
1665 /* Print "node" to "p".
1667 __isl_give isl_printer
*isl_printer_print_ast_node(__isl_take isl_printer
*p
,
1668 __isl_keep isl_ast_node
*node
)
1671 isl_ast_print_options
*options
;
1676 format
= isl_printer_get_output_format(p
);
1678 case ISL_FORMAT_ISL
:
1679 p
= print_ast_node_isl(p
, node
);
1682 options
= isl_ast_print_options_alloc(isl_printer_get_ctx(p
));
1683 p
= isl_ast_node_print(node
, p
, options
);
1686 isl_die(isl_printer_get_ctx(p
), isl_error_unsupported
,
1687 "output format not supported for ast_node",
1688 return isl_printer_free(p
));
1694 /* Print the list of nodes "list" to "p".
1696 __isl_give isl_printer
*isl_ast_node_list_print(
1697 __isl_keep isl_ast_node_list
*list
, __isl_take isl_printer
*p
,
1698 __isl_keep isl_ast_print_options
*options
)
1702 if (!p
|| !list
|| !options
)
1703 return isl_printer_free(p
);
1705 for (i
= 0; i
< list
->n
; ++i
)
1706 p
= print_ast_node_c(p
, list
->p
[i
], options
, 1, 1);
1711 #define ISL_AST_MACRO_FLOORD (1 << 0)
1712 #define ISL_AST_MACRO_MIN (1 << 1)
1713 #define ISL_AST_MACRO_MAX (1 << 2)
1714 #define ISL_AST_MACRO_ALL (ISL_AST_MACRO_FLOORD | \
1715 ISL_AST_MACRO_MIN | \
1718 /* If "expr" contains an isl_ast_op_min, isl_ast_op_max or isl_ast_op_fdiv_q
1719 * then set the corresponding bit in "macros".
1721 static int ast_expr_required_macros(__isl_keep isl_ast_expr
*expr
, int macros
)
1725 if (macros
== ISL_AST_MACRO_ALL
)
1728 if (expr
->type
!= isl_ast_expr_op
)
1731 if (expr
->u
.op
.op
== isl_ast_op_min
)
1732 macros
|= ISL_AST_MACRO_MIN
;
1733 if (expr
->u
.op
.op
== isl_ast_op_max
)
1734 macros
|= ISL_AST_MACRO_MAX
;
1735 if (expr
->u
.op
.op
== isl_ast_op_fdiv_q
)
1736 macros
|= ISL_AST_MACRO_FLOORD
;
1738 for (i
= 0; i
< expr
->u
.op
.n_arg
; ++i
)
1739 macros
= ast_expr_required_macros(expr
->u
.op
.args
[i
], macros
);
1744 static int ast_node_list_required_macros(__isl_keep isl_ast_node_list
*list
,
1747 /* If "node" contains an isl_ast_op_min, isl_ast_op_max or isl_ast_op_fdiv_q
1748 * then set the corresponding bit in "macros".
1750 static int ast_node_required_macros(__isl_keep isl_ast_node
*node
, int macros
)
1752 if (macros
== ISL_AST_MACRO_ALL
)
1755 switch (node
->type
) {
1756 case isl_ast_node_for
:
1757 macros
= ast_expr_required_macros(node
->u
.f
.init
, macros
);
1758 if (!node
->u
.f
.degenerate
) {
1759 macros
= ast_expr_required_macros(node
->u
.f
.cond
,
1761 macros
= ast_expr_required_macros(node
->u
.f
.inc
,
1764 macros
= ast_node_required_macros(node
->u
.f
.body
, macros
);
1766 case isl_ast_node_if
:
1767 macros
= ast_expr_required_macros(node
->u
.i
.guard
, macros
);
1768 macros
= ast_node_required_macros(node
->u
.i
.then
, macros
);
1769 if (node
->u
.i
.else_node
)
1770 macros
= ast_node_required_macros(node
->u
.i
.else_node
,
1773 case isl_ast_node_block
:
1774 macros
= ast_node_list_required_macros(node
->u
.b
.children
,
1777 case isl_ast_node_user
:
1778 macros
= ast_expr_required_macros(node
->u
.e
.expr
, macros
);
1780 case isl_ast_node_error
:
1787 /* If "list" contains an isl_ast_op_min, isl_ast_op_max or isl_ast_op_fdiv_q
1788 * then set the corresponding bit in "macros".
1790 static int ast_node_list_required_macros(__isl_keep isl_ast_node_list
*list
,
1795 for (i
= 0; i
< list
->n
; ++i
)
1796 macros
= ast_node_required_macros(list
->p
[i
], macros
);
1801 /* Print a macro definition for the operator "type".
1803 __isl_give isl_printer
*isl_ast_op_type_print_macro(
1804 enum isl_ast_op_type type
, __isl_take isl_printer
*p
)
1807 case isl_ast_op_min
:
1808 p
= isl_printer_start_line(p
);
1809 p
= isl_printer_print_str(p
,
1810 "#define min(x,y) ((x) < (y) ? (x) : (y))");
1811 p
= isl_printer_end_line(p
);
1813 case isl_ast_op_max
:
1814 p
= isl_printer_start_line(p
);
1815 p
= isl_printer_print_str(p
,
1816 "#define max(x,y) ((x) > (y) ? (x) : (y))");
1817 p
= isl_printer_end_line(p
);
1819 case isl_ast_op_fdiv_q
:
1820 p
= isl_printer_start_line(p
);
1821 p
= isl_printer_print_str(p
,
1822 "#define floord(n,d) "
1823 "(((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))");
1824 p
= isl_printer_end_line(p
);
1833 /* Call "fn" for each type of operation that appears in "node"
1834 * and that requires a macro definition.
1836 int isl_ast_node_foreach_ast_op_type(__isl_keep isl_ast_node
*node
,
1837 int (*fn
)(enum isl_ast_op_type type
, void *user
), void *user
)
1844 macros
= ast_node_required_macros(node
, 0);
1846 if (macros
& ISL_AST_MACRO_MIN
&& fn(isl_ast_op_min
, user
) < 0)
1848 if (macros
& ISL_AST_MACRO_MAX
&& fn(isl_ast_op_max
, user
) < 0)
1850 if (macros
& ISL_AST_MACRO_FLOORD
&& fn(isl_ast_op_fdiv_q
, user
) < 0)
1856 static int ast_op_type_print_macro(enum isl_ast_op_type type
, void *user
)
1858 isl_printer
**p
= user
;
1860 *p
= isl_ast_op_type_print_macro(type
, *p
);
1865 /* Print macro definitions for all the macros used in the result
1866 * of printing "node.
1868 __isl_give isl_printer
*isl_ast_node_print_macros(
1869 __isl_keep isl_ast_node
*node
, __isl_take isl_printer
*p
)
1871 if (isl_ast_node_foreach_ast_op_type(node
,
1872 &ast_op_type_print_macro
, &p
) < 0)
1873 return isl_printer_free(p
);