1 /* Translation of CLAST (CLooG AST) to Gimple.
2 Copyright (C) 2009, 2010 Free Software Foundation, Inc.
3 Contributed by Sebastian Pop <sebastian.pop@amd.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
28 #include "basic-block.h"
29 #include "diagnostic.h"
30 #include "tree-flow.h"
32 #include "tree-dump.h"
35 #include "tree-chrec.h"
36 #include "tree-data-ref.h"
37 #include "tree-scalar-evolution.h"
38 #include "tree-pass.h"
40 #include "value-prof.h"
41 #include "pointer-set.h"
43 #include "langhooks.h"
47 #include "cloog/cloog.h"
49 #include "graphite-cloog-util.h"
50 #include "graphite-ppl.h"
52 #include "graphite-poly.h"
53 #include "graphite-scop-detection.h"
54 #include "graphite-clast-to-gimple.h"
55 #include "graphite-dependences.h"
56 #include "graphite-cloog-compat.h"
58 /* This flag is set when an error occurred during the translation of
60 static bool gloog_error
;
62 /* Verifies properties that GRAPHITE should maintain during translation. */
65 graphite_verify (void)
67 #ifdef ENABLE_CHECKING
68 verify_loop_structure ();
69 verify_dominators (CDI_DOMINATORS
);
70 verify_dominators (CDI_POST_DOMINATORS
);
71 verify_loop_closed_ssa (true);
75 /* Stores the INDEX in a vector for a given clast NAME. */
77 typedef struct clast_name_index
{
80 } *clast_name_index_p
;
82 /* Returns a pointer to a new element of type clast_name_index_p built
83 from NAME and INDEX. */
85 static inline clast_name_index_p
86 new_clast_name_index (const char *name
, int index
)
88 clast_name_index_p res
= XNEW (struct clast_name_index
);
95 /* For a given clast NAME, returns -1 if it does not correspond to any
96 parameter, or otherwise, returns the index in the PARAMS or
97 SCATTERING_DIMENSIONS vector. */
100 clast_name_to_index (clast_name_p name
, htab_t index_table
)
102 struct clast_name_index tmp
;
106 gcc_assert (name
->type
== clast_expr_name
);
107 tmp
.name
= ((const struct clast_name
*) name
)->name
;
112 slot
= htab_find_slot (index_table
, &tmp
, NO_INSERT
);
115 return ((struct clast_name_index
*) *slot
)->index
;
120 /* Records in INDEX_TABLE the INDEX for NAME. */
123 save_clast_name_index (htab_t index_table
, const char *name
, int index
)
125 struct clast_name_index tmp
;
129 slot
= htab_find_slot (index_table
, &tmp
, INSERT
);
136 *slot
= new_clast_name_index (name
, index
);
140 /* Computes a hash function for database element ELT. */
142 static inline hashval_t
143 clast_name_index_elt_info (const void *elt
)
145 return htab_hash_pointer (((const struct clast_name_index
*) elt
)->name
);
148 /* Compares database elements E1 and E2. */
151 eq_clast_name_indexes (const void *e1
, const void *e2
)
153 const struct clast_name_index
*elt1
= (const struct clast_name_index
*) e1
;
154 const struct clast_name_index
*elt2
= (const struct clast_name_index
*) e2
;
156 return (elt1
->name
== elt2
->name
);
159 /* For a given scattering dimension, return the new induction variable
163 newivs_to_depth_to_newiv (VEC (tree
, heap
) *newivs
, int depth
)
165 return VEC_index (tree
, newivs
, depth
);
170 /* Returns the tree variable from the name NAME that was given in
171 Cloog representation. */
174 clast_name_to_gcc (clast_name_p name
, sese region
, VEC (tree
, heap
) *newivs
,
175 htab_t newivs_index
, htab_t params_index
)
178 VEC (tree
, heap
) *params
= SESE_PARAMS (region
);
180 if (params
&& params_index
)
182 index
= clast_name_to_index (name
, params_index
);
185 return VEC_index (tree
, params
, index
);
188 gcc_assert (newivs
&& newivs_index
);
189 index
= clast_name_to_index (name
, newivs_index
);
190 gcc_assert (index
>= 0);
192 return newivs_to_depth_to_newiv (newivs
, index
);
195 /* Returns the signed maximal precision type for expressions TYPE1 and TYPE2. */
198 max_signed_precision_type (tree type1
, tree type2
)
200 int p1
= TYPE_PRECISION (type1
);
201 int p2
= TYPE_PRECISION (type2
);
204 enum machine_mode mode
;
207 precision
= TYPE_UNSIGNED (type1
) ? p1
* 2 : p1
;
209 precision
= TYPE_UNSIGNED (type2
) ? p2
* 2 : p2
;
211 if (precision
> BITS_PER_WORD
)
214 return integer_type_node
;
217 mode
= smallest_mode_for_size (precision
, MODE_INT
);
218 precision
= GET_MODE_PRECISION (mode
);
219 type
= build_nonstandard_integer_type (precision
, false);
224 return integer_type_node
;
230 /* Returns the maximal precision type for expressions TYPE1 and TYPE2. */
233 max_precision_type (tree type1
, tree type2
)
235 if (POINTER_TYPE_P (type1
))
238 if (POINTER_TYPE_P (type2
))
241 if (!TYPE_UNSIGNED (type1
)
242 || !TYPE_UNSIGNED (type2
))
243 return max_signed_precision_type (type1
, type2
);
245 return TYPE_PRECISION (type1
) > TYPE_PRECISION (type2
) ? type1
: type2
;
249 clast_to_gcc_expression (tree
, struct clast_expr
*, sese
, VEC (tree
, heap
) *,
252 /* Converts a Cloog reduction expression R with reduction operation OP
253 to a GCC expression tree of type TYPE. */
256 clast_to_gcc_expression_red (tree type
, enum tree_code op
,
257 struct clast_reduction
*r
,
258 sese region
, VEC (tree
, heap
) *newivs
,
259 htab_t newivs_index
, htab_t params_index
)
262 tree res
= clast_to_gcc_expression (type
, r
->elts
[0], region
, newivs
,
263 newivs_index
, params_index
);
264 tree operand_type
= (op
== POINTER_PLUS_EXPR
) ? sizetype
: type
;
266 for (i
= 1; i
< r
->n
; i
++)
268 tree t
= clast_to_gcc_expression (operand_type
, r
->elts
[i
], region
,
269 newivs
, newivs_index
, params_index
);
270 res
= fold_build2 (op
, type
, res
, t
);
276 /* Converts a Cloog AST expression E back to a GCC expression tree of
280 clast_to_gcc_expression (tree type
, struct clast_expr
*e
,
281 sese region
, VEC (tree
, heap
) *newivs
,
282 htab_t newivs_index
, htab_t params_index
)
286 case clast_expr_term
:
288 struct clast_term
*t
= (struct clast_term
*) e
;
292 if (mpz_cmp_si (t
->val
, 1) == 0)
294 tree name
= clast_name_to_gcc (t
->var
, region
, newivs
,
295 newivs_index
, params_index
);
297 if (POINTER_TYPE_P (TREE_TYPE (name
)) != POINTER_TYPE_P (type
))
298 name
= fold_convert (sizetype
, name
);
300 name
= fold_convert (type
, name
);
304 else if (mpz_cmp_si (t
->val
, -1) == 0)
306 tree name
= clast_name_to_gcc (t
->var
, region
, newivs
,
307 newivs_index
, params_index
);
309 if (POINTER_TYPE_P (TREE_TYPE (name
)) != POINTER_TYPE_P (type
))
310 name
= fold_convert (sizetype
, name
);
312 name
= fold_convert (type
, name
);
314 return fold_build1 (NEGATE_EXPR
, type
, name
);
318 tree name
= clast_name_to_gcc (t
->var
, region
, newivs
,
319 newivs_index
, params_index
);
320 tree cst
= gmp_cst_to_tree (type
, t
->val
);
322 if (POINTER_TYPE_P (TREE_TYPE (name
)) != POINTER_TYPE_P (type
))
323 name
= fold_convert (sizetype
, name
);
325 name
= fold_convert (type
, name
);
327 if (!POINTER_TYPE_P (type
))
328 return fold_build2 (MULT_EXPR
, type
, cst
, name
);
335 return gmp_cst_to_tree (type
, t
->val
);
340 struct clast_reduction
*r
= (struct clast_reduction
*) e
;
345 return clast_to_gcc_expression_red
346 (type
, POINTER_TYPE_P (type
) ? POINTER_PLUS_EXPR
: PLUS_EXPR
,
347 r
, region
, newivs
, newivs_index
, params_index
);
350 return clast_to_gcc_expression_red (type
, MIN_EXPR
, r
, region
,
351 newivs
, newivs_index
,
355 return clast_to_gcc_expression_red (type
, MAX_EXPR
, r
, region
,
356 newivs
, newivs_index
,
367 struct clast_binary
*b
= (struct clast_binary
*) e
;
368 struct clast_expr
*lhs
= (struct clast_expr
*) b
->LHS
;
369 tree tl
= clast_to_gcc_expression (type
, lhs
, region
, newivs
,
370 newivs_index
, params_index
);
371 tree tr
= gmp_cst_to_tree (type
, b
->RHS
);
376 return fold_build2 (FLOOR_DIV_EXPR
, type
, tl
, tr
);
379 return fold_build2 (CEIL_DIV_EXPR
, type
, tl
, tr
);
382 return fold_build2 (EXACT_DIV_EXPR
, type
, tl
, tr
);
385 return fold_build2 (TRUNC_MOD_EXPR
, type
, tl
, tr
);
399 /* Return the precision needed to represent the value VAL. */
402 precision_for_value (mpz_t val
)
418 while (mpz_cmp (y
, x
) > 0)
431 /* Return the precision needed to represent the values between LOW and
435 precision_for_interval (mpz_t low
, mpz_t up
)
440 gcc_assert (mpz_cmp (low
, up
) <= 0);
443 mpz_sub (diff
, up
, low
);
444 precision
= precision_for_value (diff
);
450 /* Return a type that could represent the integer value VAL. */
453 gcc_type_for_interval (mpz_t low
, mpz_t up
)
455 bool unsigned_p
= true;
456 int precision
, prec_up
, prec_int
;
458 enum machine_mode mode
;
460 gcc_assert (mpz_cmp (low
, up
) <= 0);
462 if (mpz_sgn (low
) < 0)
465 prec_up
= precision_for_value (up
);
466 prec_int
= precision_for_interval (low
, up
);
467 precision
= MAX (prec_up
, prec_int
);
469 if (precision
> BITS_PER_WORD
)
472 return integer_type_node
;
475 mode
= smallest_mode_for_size (precision
, MODE_INT
);
476 precision
= GET_MODE_PRECISION (mode
);
477 type
= build_nonstandard_integer_type (precision
, unsigned_p
);
482 return integer_type_node
;
488 /* Return a type that could represent the integer value VAL, or
489 otherwise return NULL_TREE. */
492 gcc_type_for_value (mpz_t val
)
494 return gcc_type_for_interval (val
, val
);
497 /* Return the type for the clast_term T used in STMT. */
500 gcc_type_for_clast_term (struct clast_term
*t
,
501 sese region
, VEC (tree
, heap
) *newivs
,
502 htab_t newivs_index
, htab_t params_index
)
504 gcc_assert (t
->expr
.type
== clast_expr_term
);
507 return gcc_type_for_value (t
->val
);
509 return TREE_TYPE (clast_name_to_gcc (t
->var
, region
, newivs
,
510 newivs_index
, params_index
));
514 gcc_type_for_clast_expr (struct clast_expr
*, sese
,
515 VEC (tree
, heap
) *, htab_t
, htab_t
);
517 /* Return the type for the clast_reduction R used in STMT. */
520 gcc_type_for_clast_red (struct clast_reduction
*r
, sese region
,
521 VEC (tree
, heap
) *newivs
,
522 htab_t newivs_index
, htab_t params_index
)
525 tree type
= NULL_TREE
;
528 return gcc_type_for_clast_expr (r
->elts
[0], region
, newivs
,
529 newivs_index
, params_index
);
536 type
= gcc_type_for_clast_expr (r
->elts
[0], region
, newivs
,
537 newivs_index
, params_index
);
538 for (i
= 1; i
< r
->n
; i
++)
539 type
= max_precision_type (type
, gcc_type_for_clast_expr
540 (r
->elts
[i
], region
, newivs
,
541 newivs_index
, params_index
));
553 /* Return the type for the clast_binary B used in STMT. */
556 gcc_type_for_clast_bin (struct clast_binary
*b
,
557 sese region
, VEC (tree
, heap
) *newivs
,
558 htab_t newivs_index
, htab_t params_index
)
560 tree l
= gcc_type_for_clast_expr ((struct clast_expr
*) b
->LHS
, region
,
561 newivs
, newivs_index
, params_index
);
562 tree r
= gcc_type_for_value (b
->RHS
);
563 return max_signed_precision_type (l
, r
);
566 /* Returns the type for the CLAST expression E when used in statement
570 gcc_type_for_clast_expr (struct clast_expr
*e
,
571 sese region
, VEC (tree
, heap
) *newivs
,
572 htab_t newivs_index
, htab_t params_index
)
576 case clast_expr_term
:
577 return gcc_type_for_clast_term ((struct clast_term
*) e
, region
,
578 newivs
, newivs_index
, params_index
);
581 return gcc_type_for_clast_red ((struct clast_reduction
*) e
, region
,
582 newivs
, newivs_index
, params_index
);
585 return gcc_type_for_clast_bin ((struct clast_binary
*) e
, region
,
586 newivs
, newivs_index
, params_index
);
595 /* Returns the type for the equation CLEQ. */
598 gcc_type_for_clast_eq (struct clast_equation
*cleq
,
599 sese region
, VEC (tree
, heap
) *newivs
,
600 htab_t newivs_index
, htab_t params_index
)
602 tree l
= gcc_type_for_clast_expr (cleq
->LHS
, region
, newivs
,
603 newivs_index
, params_index
);
604 tree r
= gcc_type_for_clast_expr (cleq
->RHS
, region
, newivs
,
605 newivs_index
, params_index
);
606 return max_precision_type (l
, r
);
609 /* Translates a clast equation CLEQ to a tree. */
612 graphite_translate_clast_equation (sese region
,
613 struct clast_equation
*cleq
,
614 VEC (tree
, heap
) *newivs
,
615 htab_t newivs_index
, htab_t params_index
)
618 tree type
= gcc_type_for_clast_eq (cleq
, region
, newivs
, newivs_index
,
620 tree lhs
= clast_to_gcc_expression (type
, cleq
->LHS
, region
, newivs
,
621 newivs_index
, params_index
);
622 tree rhs
= clast_to_gcc_expression (type
, cleq
->RHS
, region
, newivs
,
623 newivs_index
, params_index
);
628 else if (cleq
->sign
> 0)
634 return fold_build2 (comp
, boolean_type_node
, lhs
, rhs
);
637 /* Creates the test for the condition in STMT. */
640 graphite_create_guard_cond_expr (sese region
, struct clast_guard
*stmt
,
641 VEC (tree
, heap
) *newivs
,
642 htab_t newivs_index
, htab_t params_index
)
647 for (i
= 0; i
< stmt
->n
; i
++)
649 tree eq
= graphite_translate_clast_equation (region
, &stmt
->eq
[i
],
650 newivs
, newivs_index
,
654 cond
= fold_build2 (TRUTH_AND_EXPR
, TREE_TYPE (eq
), cond
, eq
);
662 /* Creates a new if region corresponding to Cloog's guard. */
665 graphite_create_new_guard (sese region
, edge entry_edge
,
666 struct clast_guard
*stmt
,
667 VEC (tree
, heap
) *newivs
,
668 htab_t newivs_index
, htab_t params_index
)
670 tree cond_expr
= graphite_create_guard_cond_expr (region
, stmt
, newivs
,
671 newivs_index
, params_index
);
672 edge exit_edge
= create_empty_if_region_on_edge (entry_edge
, cond_expr
);
676 /* Compute the lower bound LOW and upper bound UP for the induction
677 variable at LEVEL for the statement PBB, based on the transformed
678 scattering of PBB: T|I|G|Cst, with T the scattering transform, I
679 the iteration domain, and G the context parameters. */
682 compute_bounds_for_level (poly_bb_p pbb
, int level
, mpz_t low
, mpz_t up
)
684 ppl_Pointset_Powerset_C_Polyhedron_t ps
;
685 ppl_Linear_Expression_t le
;
687 combine_context_id_scat (&ps
, pbb
, false);
689 /* Prepare the linear expression corresponding to the level that we
690 want to maximize/minimize. */
692 ppl_dimension_type dim
= pbb_nb_scattering_transform (pbb
)
693 + pbb_dim_iter_domain (pbb
) + pbb_nb_params (pbb
);
695 ppl_new_Linear_Expression_with_dimension (&le
, dim
);
696 ppl_set_coef (le
, 2 * level
+ 1, 1);
699 ppl_max_for_le_pointset (ps
, le
, up
);
700 ppl_min_for_le_pointset (ps
, le
, low
);
703 /* Compute the type for the induction variable at LEVEL for the
704 statement PBB, based on the transformed schedule of PBB. */
707 compute_type_for_level (poly_bb_p pbb
, int level
)
715 compute_bounds_for_level (pbb
, level
, low
, up
);
716 type
= gcc_type_for_interval (low
, up
);
723 /* Walks a CLAST and returns the first statement in the body of a
726 static struct clast_user_stmt
*
727 clast_get_body_of_loop (struct clast_stmt
*stmt
)
730 || CLAST_STMT_IS_A (stmt
, stmt_user
))
731 return (struct clast_user_stmt
*) stmt
;
733 if (CLAST_STMT_IS_A (stmt
, stmt_for
))
734 return clast_get_body_of_loop (((struct clast_for
*) stmt
)->body
);
736 if (CLAST_STMT_IS_A (stmt
, stmt_guard
))
737 return clast_get_body_of_loop (((struct clast_guard
*) stmt
)->then
);
739 if (CLAST_STMT_IS_A (stmt
, stmt_block
))
740 return clast_get_body_of_loop (((struct clast_block
*) stmt
)->body
);
745 /* Returns the type for the induction variable for the loop translated
749 gcc_type_for_iv_of_clast_loop (struct clast_for
*stmt_for
, int level
,
750 tree lb_type
, tree ub_type
)
752 struct clast_stmt
*stmt
= (struct clast_stmt
*) stmt_for
;
753 struct clast_user_stmt
*body
= clast_get_body_of_loop (stmt
);
754 CloogStatement
*cs
= body
->statement
;
755 poly_bb_p pbb
= (poly_bb_p
) cloog_statement_usr (cs
);
757 return max_signed_precision_type (lb_type
, max_precision_type
758 (ub_type
, compute_type_for_level
762 /* Creates a new LOOP corresponding to Cloog's STMT. Inserts an
763 induction variable for the new LOOP. New LOOP is attached to CFG
764 starting at ENTRY_EDGE. LOOP is inserted into the loop tree and
765 becomes the child loop of the OUTER_LOOP. NEWIVS_INDEX binds
766 CLooG's scattering name to the induction variable created for the
767 loop of STMT. The new induction variable is inserted in the NEWIVS
771 graphite_create_new_loop (sese region
, edge entry_edge
,
772 struct clast_for
*stmt
,
773 loop_p outer
, VEC (tree
, heap
) **newivs
,
774 htab_t newivs_index
, htab_t params_index
, int level
)
776 tree lb_type
= gcc_type_for_clast_expr (stmt
->LB
, region
, *newivs
,
777 newivs_index
, params_index
);
778 tree ub_type
= gcc_type_for_clast_expr (stmt
->UB
, region
, *newivs
,
779 newivs_index
, params_index
);
780 tree type
= gcc_type_for_iv_of_clast_loop (stmt
, level
, lb_type
, ub_type
);
781 tree lb
= clast_to_gcc_expression (type
, stmt
->LB
, region
, *newivs
,
782 newivs_index
, params_index
);
783 tree ub
= clast_to_gcc_expression (type
, stmt
->UB
, region
, *newivs
,
784 newivs_index
, params_index
);
785 tree stride
= gmp_cst_to_tree (type
, stmt
->stride
);
786 tree ivvar
= create_tmp_var (type
, "graphite_IV");
787 tree iv
, iv_after_increment
;
788 loop_p loop
= create_empty_loop_on_edge
789 (entry_edge
, lb
, stride
, ub
, ivvar
, &iv
, &iv_after_increment
,
790 outer
? outer
: entry_edge
->src
->loop_father
);
792 add_referenced_var (ivvar
);
794 save_clast_name_index (newivs_index
, stmt
->iterator
,
795 VEC_length (tree
, *newivs
));
796 VEC_safe_push (tree
, heap
, *newivs
, iv
);
800 /* Inserts in iv_map a tuple (OLD_LOOP->num, NEW_NAME) for the
801 induction variables of the loops around GBB in SESE. */
804 build_iv_mapping (VEC (tree
, heap
) *iv_map
, sese region
,
805 VEC (tree
, heap
) *newivs
, htab_t newivs_index
,
806 struct clast_user_stmt
*user_stmt
,
809 struct clast_stmt
*t
;
811 CloogStatement
*cs
= user_stmt
->statement
;
812 poly_bb_p pbb
= (poly_bb_p
) cloog_statement_usr (cs
);
813 gimple_bb_p gbb
= PBB_BLACK_BOX (pbb
);
815 for (t
= user_stmt
->substitutions
; t
; t
= t
->next
, depth
++)
817 struct clast_expr
*expr
= (struct clast_expr
*)
818 ((struct clast_assignment
*)t
)->RHS
;
819 tree type
= gcc_type_for_clast_expr (expr
, region
, newivs
,
820 newivs_index
, params_index
);
821 tree new_name
= clast_to_gcc_expression (type
, expr
, region
, newivs
,
822 newivs_index
, params_index
);
823 loop_p old_loop
= gbb_loop_at_index (gbb
, region
, depth
);
825 VEC_replace (tree
, iv_map
, old_loop
->num
, new_name
);
829 /* Construct bb_pbb_def with BB and PBB. */
832 new_bb_pbb_def (basic_block bb
, poly_bb_p pbb
)
834 bb_pbb_def
*bb_pbb_p
;
836 bb_pbb_p
= XNEW (bb_pbb_def
);
843 /* Mark BB with it's relevant PBB via hashing table BB_PBB_MAPPING. */
846 mark_bb_with_pbb (poly_bb_p pbb
, basic_block bb
, htab_t bb_pbb_mapping
)
852 x
= htab_find_slot (bb_pbb_mapping
, &tmp
, INSERT
);
855 *x
= new_bb_pbb_def (bb
, pbb
);
858 /* Find BB's related poly_bb_p in hash table BB_PBB_MAPPING. */
861 find_pbb_via_hash (htab_t bb_pbb_mapping
, basic_block bb
)
867 slot
= htab_find_slot (bb_pbb_mapping
, &tmp
, NO_INSERT
);
870 return ((bb_pbb_def
*) *slot
)->pbb
;
875 /* Check data dependency in LOOP at scattering level LEVEL.
876 BB_PBB_MAPPING is a basic_block and it's related poly_bb_p
880 dependency_in_loop_p (loop_p loop
, htab_t bb_pbb_mapping
, int level
)
883 basic_block
*bbs
= get_loop_body_in_dom_order (loop
);
885 for (i
= 0; i
< loop
->num_nodes
; i
++)
887 poly_bb_p pbb1
= find_pbb_via_hash (bb_pbb_mapping
, bbs
[i
]);
892 for (j
= 0; j
< loop
->num_nodes
; j
++)
894 poly_bb_p pbb2
= find_pbb_via_hash (bb_pbb_mapping
, bbs
[j
]);
899 if (dependency_between_pbbs_p (pbb1
, pbb2
, level
))
912 /* Translates a clast user statement STMT to gimple.
914 - REGION is the sese region we used to generate the scop.
915 - NEXT_E is the edge where new generated code should be attached.
916 - CONTEXT_LOOP is the loop in which the generated code will be placed
917 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
918 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
921 translate_clast_user (sese region
, struct clast_user_stmt
*stmt
, edge next_e
,
922 VEC (tree
, heap
) **newivs
,
923 htab_t newivs_index
, htab_t bb_pbb_mapping
,
928 poly_bb_p pbb
= (poly_bb_p
) cloog_statement_usr (stmt
->statement
);
929 gimple_bb_p gbb
= PBB_BLACK_BOX (pbb
);
930 VEC (tree
, heap
) *iv_map
;
932 if (GBB_BB (gbb
) == ENTRY_BLOCK_PTR
)
935 nb_loops
= number_of_loops ();
936 iv_map
= VEC_alloc (tree
, heap
, nb_loops
);
937 for (i
= 0; i
< nb_loops
; i
++)
938 VEC_quick_push (tree
, iv_map
, NULL_TREE
);
940 build_iv_mapping (iv_map
, region
, *newivs
, newivs_index
, stmt
, params_index
);
941 next_e
= copy_bb_and_scalar_dependences (GBB_BB (gbb
), region
,
943 VEC_free (tree
, heap
, iv_map
);
945 new_bb
= next_e
->src
;
946 mark_bb_with_pbb (pbb
, new_bb
, bb_pbb_mapping
);
947 update_ssa (TODO_update_ssa
);
952 /* Creates a new if region protecting the loop to be executed, if the execution
953 count is zero (lb > ub). */
956 graphite_create_new_loop_guard (sese region
, edge entry_edge
,
957 struct clast_for
*stmt
,
958 VEC (tree
, heap
) *newivs
,
959 htab_t newivs_index
, htab_t params_index
)
963 tree lb_type
= gcc_type_for_clast_expr (stmt
->LB
, region
, newivs
,
964 newivs_index
, params_index
);
965 tree ub_type
= gcc_type_for_clast_expr (stmt
->UB
, region
, newivs
,
966 newivs_index
, params_index
);
967 tree type
= max_precision_type (lb_type
, ub_type
);
968 tree lb
= clast_to_gcc_expression (type
, stmt
->LB
, region
, newivs
,
969 newivs_index
, params_index
);
970 tree ub
= clast_to_gcc_expression (type
, stmt
->UB
, region
, newivs
,
971 newivs_index
, params_index
);
972 tree one
= POINTER_TYPE_P (type
) ? size_one_node
973 : fold_convert (type
, integer_one_node
);
974 /* Adding +1 and using LT_EXPR helps with loop latches that have a
975 loop iteration count of "PARAMETER - 1". For PARAMETER == 0 this becomes
976 2^{32|64}, and the condition lb <= ub is true, even if we do not want this.
977 However lb < ub + 1 is false, as expected. */
978 tree ub_one
= fold_build2 (POINTER_TYPE_P (type
) ? POINTER_PLUS_EXPR
979 : PLUS_EXPR
, type
, ub
, one
);
981 /* When ub + 1 wraps around, use lb <= ub. */
982 if (integer_zerop (ub_one
))
983 cond_expr
= fold_build2 (LE_EXPR
, boolean_type_node
, lb
, ub
);
985 cond_expr
= fold_build2 (LT_EXPR
, boolean_type_node
, lb
, ub_one
);
987 exit_edge
= create_empty_if_region_on_edge (entry_edge
, cond_expr
);
993 translate_clast (sese
, loop_p
, struct clast_stmt
*, edge
,
994 VEC (tree
, heap
) **, htab_t
, htab_t
, int, htab_t
);
996 /* Create the loop for a clast for statement.
998 - REGION is the sese region we used to generate the scop.
999 - NEXT_E is the edge where new generated code should be attached.
1000 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1001 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1004 translate_clast_for_loop (sese region
, loop_p context_loop
,
1005 struct clast_for
*stmt
, edge next_e
,
1006 VEC (tree
, heap
) **newivs
,
1007 htab_t newivs_index
, htab_t bb_pbb_mapping
,
1008 int level
, htab_t params_index
)
1010 struct loop
*loop
= graphite_create_new_loop (region
, next_e
, stmt
,
1011 context_loop
, newivs
,
1012 newivs_index
, params_index
,
1014 edge last_e
= single_exit (loop
);
1015 edge to_body
= single_succ_edge (loop
->header
);
1016 basic_block after
= to_body
->dest
;
1018 /* Create a basic block for loop close phi nodes. */
1019 last_e
= single_succ_edge (split_edge (last_e
));
1021 /* Translate the body of the loop. */
1022 next_e
= translate_clast (region
, loop
, stmt
->body
, to_body
,
1023 newivs
, newivs_index
, bb_pbb_mapping
, level
+ 1,
1025 redirect_edge_succ_nodup (next_e
, after
);
1026 set_immediate_dominator (CDI_DOMINATORS
, next_e
->dest
, next_e
->src
);
1028 if (flag_loop_parallelize_all
1029 && !dependency_in_loop_p (loop
, bb_pbb_mapping
,
1030 get_scattering_level (level
)))
1031 loop
->can_be_parallel
= true;
1036 /* Translates a clast for statement STMT to gimple. First a guard is created
1037 protecting the loop, if it is executed zero times. In this guard we create
1038 the real loop structure.
1040 - REGION is the sese region we used to generate the scop.
1041 - NEXT_E is the edge where new generated code should be attached.
1042 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1043 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1046 translate_clast_for (sese region
, loop_p context_loop
, struct clast_for
*stmt
,
1047 edge next_e
, VEC (tree
, heap
) **newivs
,
1048 htab_t newivs_index
, htab_t bb_pbb_mapping
, int level
,
1049 htab_t params_index
)
1051 edge last_e
= graphite_create_new_loop_guard (region
, next_e
, stmt
, *newivs
,
1052 newivs_index
, params_index
);
1053 edge true_e
= get_true_edge_from_guard_bb (next_e
->dest
);
1055 translate_clast_for_loop (region
, context_loop
, stmt
, true_e
, newivs
,
1056 newivs_index
, bb_pbb_mapping
, level
,
1061 /* Translates a clast guard statement STMT to gimple.
1063 - REGION is the sese region we used to generate the scop.
1064 - NEXT_E is the edge where new generated code should be attached.
1065 - CONTEXT_LOOP is the loop in which the generated code will be placed
1066 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1067 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1070 translate_clast_guard (sese region
, loop_p context_loop
,
1071 struct clast_guard
*stmt
, edge next_e
,
1072 VEC (tree
, heap
) **newivs
,
1073 htab_t newivs_index
, htab_t bb_pbb_mapping
, int level
,
1074 htab_t params_index
)
1076 edge last_e
= graphite_create_new_guard (region
, next_e
, stmt
, *newivs
,
1077 newivs_index
, params_index
);
1078 edge true_e
= get_true_edge_from_guard_bb (next_e
->dest
);
1080 translate_clast (region
, context_loop
, stmt
->then
, true_e
,
1081 newivs
, newivs_index
, bb_pbb_mapping
,
1082 level
, params_index
);
1086 /* Translates a CLAST statement STMT to GCC representation in the
1089 - NEXT_E is the edge where new generated code should be attached.
1090 - CONTEXT_LOOP is the loop in which the generated code will be placed
1091 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping. */
1093 translate_clast (sese region
, loop_p context_loop
, struct clast_stmt
*stmt
,
1094 edge next_e
, VEC (tree
, heap
) **newivs
,
1095 htab_t newivs_index
, htab_t bb_pbb_mapping
, int level
,
1096 htab_t params_index
)
1101 if (CLAST_STMT_IS_A (stmt
, stmt_root
))
1104 else if (CLAST_STMT_IS_A (stmt
, stmt_user
))
1105 next_e
= translate_clast_user (region
, (struct clast_user_stmt
*) stmt
,
1106 next_e
, newivs
, newivs_index
,
1107 bb_pbb_mapping
, params_index
);
1109 else if (CLAST_STMT_IS_A (stmt
, stmt_for
))
1110 next_e
= translate_clast_for (region
, context_loop
,
1111 (struct clast_for
*) stmt
, next_e
,
1112 newivs
, newivs_index
,
1113 bb_pbb_mapping
, level
, params_index
);
1115 else if (CLAST_STMT_IS_A (stmt
, stmt_guard
))
1116 next_e
= translate_clast_guard (region
, context_loop
,
1117 (struct clast_guard
*) stmt
, next_e
,
1118 newivs
, newivs_index
,
1119 bb_pbb_mapping
, level
, params_index
);
1121 else if (CLAST_STMT_IS_A (stmt
, stmt_block
))
1122 next_e
= translate_clast (region
, context_loop
,
1123 ((struct clast_block
*) stmt
)->body
,
1124 next_e
, newivs
, newivs_index
,
1125 bb_pbb_mapping
, level
, params_index
);
1129 recompute_all_dominators ();
1132 return translate_clast (region
, context_loop
, stmt
->next
, next_e
,
1133 newivs
, newivs_index
,
1134 bb_pbb_mapping
, level
, params_index
);
1137 /* Free the SCATTERING domain list. */
1140 free_scattering (CloogScatteringList
*scattering
)
1144 CloogScattering
*dom
= cloog_scattering (scattering
);
1145 CloogScatteringList
*next
= cloog_next_scattering (scattering
);
1147 cloog_scattering_free (dom
);
1153 /* Initialize Cloog's parameter names from the names used in GIMPLE.
1154 Initialize Cloog's iterator names, using 'graphite_iterator_%d'
1155 from 0 to scop_nb_loops (scop). */
1158 initialize_cloog_names (scop_p scop
, CloogProgram
*prog
)
1160 sese region
= SCOP_REGION (scop
);
1162 int nb_iterators
= scop_max_loop_depth (scop
);
1163 int nb_scattering
= cloog_program_nb_scattdims (prog
);
1164 int nb_parameters
= VEC_length (tree
, SESE_PARAMS (region
));
1165 char **iterators
= XNEWVEC (char *, nb_iterators
* 2);
1166 char **scattering
= XNEWVEC (char *, nb_scattering
);
1167 char **parameters
= XNEWVEC (char *, nb_parameters
);
1169 cloog_program_set_names (prog
, cloog_names_malloc ());
1171 for (i
= 0; i
< nb_parameters
; i
++)
1173 tree param
= VEC_index (tree
, SESE_PARAMS(region
), i
);
1174 const char *name
= get_name (param
);
1180 len
= strlen (name
);
1182 parameters
[i
] = XNEWVEC (char, len
+ 1);
1183 snprintf (parameters
[i
], len
, "%s_%d", name
, SSA_NAME_VERSION (param
));
1186 cloog_names_set_nb_parameters (cloog_program_names (prog
), nb_parameters
);
1187 cloog_names_set_parameters (cloog_program_names (prog
), parameters
);
1189 for (i
= 0; i
< nb_iterators
; i
++)
1192 iterators
[i
] = XNEWVEC (char, len
);
1193 snprintf (iterators
[i
], len
, "git_%d", i
);
1196 cloog_names_set_nb_iterators (cloog_program_names (prog
),
1198 cloog_names_set_iterators (cloog_program_names (prog
),
1201 for (i
= 0; i
< nb_scattering
; i
++)
1204 scattering
[i
] = XNEWVEC (char, len
);
1205 snprintf (scattering
[i
], len
, "scat_%d", i
);
1208 cloog_names_set_nb_scattering (cloog_program_names (prog
),
1210 cloog_names_set_scattering (cloog_program_names (prog
),
1214 /* Build cloog program for SCoP. */
1217 build_cloog_prog (scop_p scop
, CloogProgram
*prog
,
1218 CloogOptions
*options
, CloogState
*state ATTRIBUTE_UNUSED
)
1221 int max_nb_loops
= scop_max_loop_depth (scop
);
1223 CloogLoop
*loop_list
= NULL
;
1224 CloogBlockList
*block_list
= NULL
;
1225 CloogScatteringList
*scattering
= NULL
;
1226 int nbs
= 2 * max_nb_loops
+ 1;
1229 cloog_program_set_context
1230 (prog
, new_Cloog_Domain_from_ppl_Pointset_Powerset (SCOP_CONTEXT (scop
),
1231 scop_nb_params (scop
), state
));
1232 nbs
= unify_scattering_dimensions (scop
);
1233 scaldims
= (int *) xmalloc (nbs
* (sizeof (int)));
1234 cloog_program_set_nb_scattdims (prog
, nbs
);
1235 initialize_cloog_names (scop
, prog
);
1237 FOR_EACH_VEC_ELT (poly_bb_p
, SCOP_BBS (scop
), i
, pbb
)
1239 CloogStatement
*stmt
;
1243 /* Dead code elimination: when the domain of a PBB is empty,
1244 don't generate code for the PBB. */
1245 if (ppl_Pointset_Powerset_C_Polyhedron_is_empty (PBB_DOMAIN (pbb
)))
1248 /* Build the new statement and its block. */
1249 stmt
= cloog_statement_alloc (state
, pbb_index (pbb
));
1250 dom
= new_Cloog_Domain_from_ppl_Pointset_Powerset (PBB_DOMAIN (pbb
),
1251 scop_nb_params (scop
),
1253 block
= cloog_block_alloc (stmt
, 0, NULL
, pbb_dim_iter_domain (pbb
));
1254 cloog_statement_set_usr (stmt
, pbb
);
1256 /* Build loop list. */
1258 CloogLoop
*new_loop_list
= cloog_loop_malloc (state
);
1259 cloog_loop_set_next (new_loop_list
, loop_list
);
1260 cloog_loop_set_domain (new_loop_list
, dom
);
1261 cloog_loop_set_block (new_loop_list
, block
);
1262 loop_list
= new_loop_list
;
1265 /* Build block list. */
1267 CloogBlockList
*new_block_list
= cloog_block_list_malloc ();
1269 cloog_block_list_set_next (new_block_list
, block_list
);
1270 cloog_block_list_set_block (new_block_list
, block
);
1271 block_list
= new_block_list
;
1274 /* Build scattering list. */
1276 /* XXX: Replace with cloog_domain_list_alloc(), when available. */
1277 CloogScatteringList
*new_scattering
1278 = (CloogScatteringList
*) xmalloc (sizeof (CloogScatteringList
));
1279 ppl_Polyhedron_t scat
;
1280 CloogScattering
*dom
;
1282 scat
= PBB_TRANSFORMED_SCATTERING (pbb
);
1283 dom
= new_Cloog_Scattering_from_ppl_Polyhedron
1284 (scat
, scop_nb_params (scop
), pbb_nb_scattering_transform (pbb
),
1287 cloog_set_next_scattering (new_scattering
, scattering
);
1288 cloog_set_scattering (new_scattering
, dom
);
1289 scattering
= new_scattering
;
1293 cloog_program_set_loop (prog
, loop_list
);
1294 cloog_program_set_blocklist (prog
, block_list
);
1296 for (i
= 0; i
< nbs
; i
++)
1299 cloog_program_set_scaldims (prog
, scaldims
);
1301 /* Extract scalar dimensions to simplify the code generation problem. */
1302 cloog_program_extract_scalars (prog
, scattering
, options
);
1304 /* Apply scattering. */
1305 cloog_program_scatter (prog
, scattering
, options
);
1306 free_scattering (scattering
);
1308 /* Iterators corresponding to scalar dimensions have to be extracted. */
1309 cloog_names_scalarize (cloog_program_names (prog
), nbs
,
1310 cloog_program_scaldims (prog
));
1312 /* Free blocklist. */
1314 CloogBlockList
*next
= cloog_program_blocklist (prog
);
1318 CloogBlockList
*toDelete
= next
;
1319 next
= cloog_block_list_next (next
);
1320 cloog_block_list_set_next (toDelete
, NULL
);
1321 cloog_block_list_set_block (toDelete
, NULL
);
1322 cloog_block_list_free (toDelete
);
1324 cloog_program_set_blocklist (prog
, NULL
);
1328 /* Return the options that will be used in GLOOG. */
1330 static CloogOptions
*
1331 set_cloog_options (CloogState
*state ATTRIBUTE_UNUSED
)
1333 CloogOptions
*options
= cloog_options_malloc (state
);
1335 /* Change cloog output language to C. If we do use FORTRAN instead, cloog
1336 will stop e.g. with "ERROR: unbounded loops not allowed in FORTRAN.", if
1337 we pass an incomplete program to cloog. */
1338 options
->language
= LANGUAGE_C
;
1340 /* Enable complex equality spreading: removes dummy statements
1341 (assignments) in the generated code which repeats the
1342 substitution equations for statements. This is useless for
1347 /* Silence CLooG to avoid failing tests due to debug output to stderr. */
1350 /* Enable C pretty-printing mode: normalizes the substitution
1351 equations for statements. */
1355 /* Allow cloog to build strides with a stride width different to one.
1356 This example has stride = 4:
1358 for (i = 0; i < 20; i += 4)
1360 options
->strides
= 1;
1362 /* Disable optimizations and make cloog generate source code closer to the
1363 input. This is useful for debugging, but later we want the optimized
1366 XXX: We can not disable optimizations, as loop blocking is not working
1371 options
->l
= INT_MAX
;
1377 /* Prints STMT to STDERR. */
1380 print_clast_stmt (FILE *file
, struct clast_stmt
*stmt
)
1382 CloogState
*state
= cloog_state_malloc ();
1383 CloogOptions
*options
= set_cloog_options (state
);
1385 clast_pprint (file
, stmt
, 0, options
);
1386 cloog_options_free (options
);
1387 cloog_state_free (state
);
1390 /* Prints STMT to STDERR. */
1393 debug_clast_stmt (struct clast_stmt
*stmt
)
1395 print_clast_stmt (stderr
, stmt
);
1398 /* Translate SCOP to a CLooG program and clast. These two
1399 representations should be freed together: a clast cannot be used
1400 without a program. */
1403 scop_to_clast (scop_p scop
, CloogState
*state
)
1405 CloogOptions
*options
= set_cloog_options (state
);
1406 cloog_prog_clast pc
;
1408 /* Connect new cloog prog generation to graphite. */
1409 pc
.prog
= cloog_program_malloc ();
1410 build_cloog_prog (scop
, pc
.prog
, options
, state
);
1411 pc
.prog
= cloog_program_generate (pc
.prog
, options
);
1412 pc
.stmt
= cloog_clast_create (pc
.prog
, options
);
1414 cloog_options_free (options
);
1418 /* Prints to FILE the code generated by CLooG for SCOP. */
1421 print_generated_program (FILE *file
, scop_p scop
)
1423 CloogState
*state
= cloog_state_malloc ();
1424 CloogOptions
*options
= set_cloog_options (state
);
1426 cloog_prog_clast pc
= scop_to_clast (scop
, state
);
1428 fprintf (file
, " (prog: \n");
1429 cloog_program_print (file
, pc
.prog
);
1430 fprintf (file
, " )\n");
1432 fprintf (file
, " (clast: \n");
1433 clast_pprint (file
, pc
.stmt
, 0, options
);
1434 fprintf (file
, " )\n");
1436 cloog_options_free (options
);
1437 cloog_clast_free (pc
.stmt
);
1438 cloog_program_free (pc
.prog
);
1441 /* Prints to STDERR the code generated by CLooG for SCOP. */
1444 debug_generated_program (scop_p scop
)
1446 print_generated_program (stderr
, scop
);
1449 /* Add CLooG names to parameter index. The index is used to translate
1450 back from CLooG names to GCC trees. */
1453 create_params_index (htab_t index_table
, CloogProgram
*prog
) {
1454 CloogNames
* names
= cloog_program_names (prog
);
1455 int nb_parameters
= cloog_names_nb_parameters (names
);
1456 char **parameters
= cloog_names_parameters (names
);
1459 for (i
= 0; i
< nb_parameters
; i
++)
1460 save_clast_name_index (index_table
, parameters
[i
], i
);
1463 /* GIMPLE Loop Generator: generates loops from STMT in GIMPLE form for
1464 the given SCOP. Return true if code generation succeeded.
1465 BB_PBB_MAPPING is a basic_block and it's related poly_bb_p mapping.
1469 gloog (scop_p scop
, htab_t bb_pbb_mapping
)
1471 VEC (tree
, heap
) *newivs
= VEC_alloc (tree
, heap
, 10);
1472 loop_p context_loop
;
1473 sese region
= SCOP_REGION (scop
);
1474 ifsese if_region
= NULL
;
1475 htab_t newivs_index
, params_index
;
1476 cloog_prog_clast pc
;
1479 state
= cloog_state_malloc ();
1480 timevar_push (TV_GRAPHITE_CODE_GEN
);
1481 gloog_error
= false;
1483 pc
= scop_to_clast (scop
, state
);
1485 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1487 fprintf (dump_file
, "\nCLAST generated by CLooG: \n");
1488 print_clast_stmt (dump_file
, pc
.stmt
);
1489 fprintf (dump_file
, "\n");
1492 recompute_all_dominators ();
1495 if_region
= move_sese_in_condition (region
);
1496 sese_insert_phis_for_liveouts (region
,
1497 if_region
->region
->exit
->src
,
1498 if_region
->false_region
->exit
,
1499 if_region
->true_region
->exit
);
1500 recompute_all_dominators ();
1503 context_loop
= SESE_ENTRY (region
)->src
->loop_father
;
1504 newivs_index
= htab_create (10, clast_name_index_elt_info
,
1505 eq_clast_name_indexes
, free
);
1506 params_index
= htab_create (10, clast_name_index_elt_info
,
1507 eq_clast_name_indexes
, free
);
1509 create_params_index (params_index
, pc
.prog
);
1511 translate_clast (region
, context_loop
, pc
.stmt
,
1512 if_region
->true_region
->entry
,
1513 &newivs
, newivs_index
,
1514 bb_pbb_mapping
, 1, params_index
);
1517 recompute_all_dominators ();
1521 set_ifsese_condition (if_region
, integer_zero_node
);
1523 free (if_region
->true_region
);
1524 free (if_region
->region
);
1527 htab_delete (newivs_index
);
1528 htab_delete (params_index
);
1529 VEC_free (tree
, heap
, newivs
);
1530 cloog_clast_free (pc
.stmt
);
1531 cloog_program_free (pc
.prog
);
1532 timevar_pop (TV_GRAPHITE_CODE_GEN
);
1534 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1538 int num_no_dependency
= 0;
1540 FOR_EACH_LOOP (li
, loop
, 0)
1541 if (loop
->can_be_parallel
)
1542 num_no_dependency
++;
1544 fprintf (dump_file
, "\n%d loops carried no dependency.\n",
1548 cloog_state_free (state
);
1550 return !gloog_error
;