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-ppl.h"
51 #include "graphite-poly.h"
52 #include "graphite-scop-detection.h"
53 #include "graphite-clast-to-gimple.h"
54 #include "graphite-dependences.h"
56 /* This flag is set when an error occurred during the translation of
58 static bool gloog_error;
60 /* Verifies properties that GRAPHITE should maintain during translation. */
63 graphite_verify (void)
65 #ifdef ENABLE_CHECKING
66 verify_loop_structure ();
67 verify_dominators (CDI_DOMINATORS);
68 verify_dominators (CDI_POST_DOMINATORS);
69 verify_loop_closed_ssa (true);
73 /* Stores the INDEX in a vector for a given clast NAME. */
75 typedef struct clast_name_index {
78 } *clast_name_index_p;
80 /* Returns a pointer to a new element of type clast_name_index_p built
81 from NAME and INDEX. */
83 static inline clast_name_index_p
84 new_clast_name_index (const char *name, int index)
86 clast_name_index_p res = XNEW (struct clast_name_index);
93 /* For a given clast NAME, returns -1 if it does not correspond to any
94 parameter, or otherwise, returns the index in the PARAMS or
95 SCATTERING_DIMENSIONS vector. */
98 clast_name_to_index (const char *name, htab_t index_table)
100 struct clast_name_index tmp;
104 slot = htab_find_slot (index_table, &tmp, NO_INSERT);
107 return ((struct clast_name_index *) *slot)->index;
112 /* Records in INDEX_TABLE the INDEX for NAME. */
115 save_clast_name_index (htab_t index_table, const char *name, int index)
117 struct clast_name_index tmp;
121 slot = htab_find_slot (index_table, &tmp, INSERT);
128 *slot = new_clast_name_index (name, index);
132 /* Print to stderr the element ELT. */
135 debug_clast_name_index (clast_name_index_p elt)
137 fprintf (stderr, "(index = %d, name = %s)\n", elt->index, elt->name);
140 /* Helper function for debug_rename_map. */
143 debug_clast_name_indexes_1 (void **slot, void *s ATTRIBUTE_UNUSED)
145 struct clast_name_index *entry = (struct clast_name_index *) *slot;
146 debug_clast_name_index (entry);
150 /* Print to stderr all the elements of MAP. */
153 debug_clast_name_indexes (htab_t map)
155 htab_traverse (map, debug_clast_name_indexes_1, NULL);
158 /* Computes a hash function for database element ELT. */
160 static inline hashval_t
161 clast_name_index_elt_info (const void *elt)
163 return htab_hash_pointer (((const struct clast_name_index *) elt)->name);
166 /* Compares database elements E1 and E2. */
169 eq_clast_name_indexes (const void *e1, const void *e2)
171 const struct clast_name_index *elt1 = (const struct clast_name_index *) e1;
172 const struct clast_name_index *elt2 = (const struct clast_name_index *) e2;
174 return (elt1->name == elt2->name);
178 /* For a given loop DEPTH in the loop nest of the original black box
179 PBB, return the old induction variable associated to that loop. */
182 pbb_to_depth_to_oldiv (poly_bb_p pbb, int depth)
184 gimple_bb_p gbb = PBB_BLACK_BOX (pbb);
185 sese region = SCOP_REGION (PBB_SCOP (pbb));
186 loop_p loop = gbb_loop_at_index (gbb, region, depth);
188 return loop->single_iv;
191 /* For a given scattering dimension, return the new induction variable
195 newivs_to_depth_to_newiv (VEC (tree, heap) *newivs, int depth)
197 return VEC_index (tree, newivs, depth);
202 /* Returns the tree variable from the name NAME that was given in
203 Cloog representation. */
206 clast_name_to_gcc (const char *name, sese region, VEC (tree, heap) *newivs,
207 htab_t newivs_index, htab_t params_index)
210 VEC (tree, heap) *params = SESE_PARAMS (region);
212 if (params && params_index)
214 index = clast_name_to_index (name, params_index);
217 return VEC_index (tree, params, index);
220 gcc_assert (newivs && newivs_index);
221 index = clast_name_to_index (name, newivs_index);
222 gcc_assert (index >= 0);
224 return newivs_to_depth_to_newiv (newivs, index);
227 /* Returns the signed maximal precision type for expressions TYPE1 and TYPE2. */
230 max_signed_precision_type (tree type1, tree type2)
232 int p1 = TYPE_PRECISION (type1);
233 int p2 = TYPE_PRECISION (type2);
234 int precision = p1 > p2 ? p1 : p2;
235 tree type = lang_hooks.types.type_for_size (precision, false);
240 return integer_type_node;
245 /* Returns the maximal precision type for expressions TYPE1 and TYPE2. */
248 max_precision_type (tree type1, tree type2)
251 if (POINTER_TYPE_P (type1))
254 if (POINTER_TYPE_P (type2))
257 if (!TYPE_UNSIGNED (type1)
258 || !TYPE_UNSIGNED (type2))
259 return max_signed_precision_type (type1, type2);
261 return TYPE_PRECISION (type1) > TYPE_PRECISION (type2) ? type1 : type2;
265 clast_to_gcc_expression (tree, struct clast_expr *, sese, VEC (tree, heap) *,
268 /* Converts a Cloog reduction expression R with reduction operation OP
269 to a GCC expression tree of type TYPE. */
272 clast_to_gcc_expression_red (tree type, enum tree_code op,
273 struct clast_reduction *r,
274 sese region, VEC (tree, heap) *newivs,
275 htab_t newivs_index, htab_t params_index)
278 tree res = clast_to_gcc_expression (type, r->elts[0], region, newivs,
279 newivs_index, params_index);
280 tree operand_type = (op == POINTER_PLUS_EXPR) ? sizetype : type;
282 for (i = 1; i < r->n; i++)
284 tree t = clast_to_gcc_expression (operand_type, r->elts[i], region,
285 newivs, newivs_index, params_index);
286 res = fold_build2 (op, type, res, t);
292 /* Converts a Cloog AST expression E back to a GCC expression tree of
296 clast_to_gcc_expression (tree type, struct clast_expr *e,
297 sese region, VEC (tree, heap) *newivs,
298 htab_t newivs_index, htab_t params_index)
304 struct clast_term *t = (struct clast_term *) e;
308 if (value_one_p (t->val))
310 tree name = clast_name_to_gcc (t->var, region, newivs,
311 newivs_index, params_index);
313 if (POINTER_TYPE_P (TREE_TYPE (name)) != POINTER_TYPE_P (type))
314 name = fold_convert (sizetype, name);
316 name = fold_convert (type, name);
320 else if (value_mone_p (t->val))
322 tree name = clast_name_to_gcc (t->var, region, newivs,
323 newivs_index, params_index);
325 if (POINTER_TYPE_P (TREE_TYPE (name)) != POINTER_TYPE_P (type))
326 name = fold_convert (sizetype, name);
328 name = fold_convert (type, name);
330 return fold_build1 (NEGATE_EXPR, type, name);
334 tree name = clast_name_to_gcc (t->var, region, newivs,
335 newivs_index, params_index);
336 tree cst = gmp_cst_to_tree (type, t->val);
338 if (POINTER_TYPE_P (TREE_TYPE (name)) != POINTER_TYPE_P (type))
339 name = fold_convert (sizetype, name);
341 name = fold_convert (type, name);
343 if (!POINTER_TYPE_P (type))
344 return fold_build2 (MULT_EXPR, type, cst, name);
351 return gmp_cst_to_tree (type, t->val);
356 struct clast_reduction *r = (struct clast_reduction *) e;
361 return clast_to_gcc_expression_red
362 (type, POINTER_TYPE_P (type) ? POINTER_PLUS_EXPR : PLUS_EXPR,
363 r, region, newivs, newivs_index, params_index);
366 return clast_to_gcc_expression_red (type, MIN_EXPR, r, region,
367 newivs, newivs_index,
371 return clast_to_gcc_expression_red (type, MAX_EXPR, r, region,
372 newivs, newivs_index,
383 struct clast_binary *b = (struct clast_binary *) e;
384 struct clast_expr *lhs = (struct clast_expr *) b->LHS;
385 tree tl = clast_to_gcc_expression (type, lhs, region, newivs,
386 newivs_index, params_index);
387 tree tr = gmp_cst_to_tree (type, b->RHS);
392 return fold_build2 (FLOOR_DIV_EXPR, type, tl, tr);
395 return fold_build2 (CEIL_DIV_EXPR, type, tl, tr);
398 return fold_build2 (EXACT_DIV_EXPR, type, tl, tr);
401 return fold_build2 (TRUNC_MOD_EXPR, type, tl, tr);
415 /* Return the precision needed to represent the value VAL. */
418 precision_for_value (Value val)
427 value_assign (y, val);
428 value_set_si (two, 2);
434 while (value_gt (y, x))
436 value_multiply (x, x, two);
447 /* Return the precision needed to represent the values between LOW and
451 precision_for_interval (Value low, Value up)
456 gcc_assert (value_le (low, up));
459 value_subtract (diff, up, low);
460 precision = precision_for_value (diff);
466 /* Return a type that could represent the integer value VAL, or
467 otherwise return NULL_TREE. */
470 gcc_type_for_interval (Value low, Value up, tree old_type)
472 bool unsigned_p = true;
473 int precision, prec_up, prec_int;
476 gcc_assert (value_le (low, up));
478 /* Preserve the signedness of the old IV. */
479 if ((old_type && !TYPE_UNSIGNED (old_type))
480 || value_neg_p (low))
483 prec_up = precision_for_value (up);
484 prec_int = precision_for_interval (low, up);
485 precision = prec_up > prec_int ? prec_up : prec_int;
487 type = lang_hooks.types.type_for_size (precision, unsigned_p);
491 return integer_type_node;
497 /* Return a type that could represent the integer value VAL, or
498 otherwise return NULL_TREE. */
501 gcc_type_for_value (Value val)
503 return gcc_type_for_interval (val, val, NULL_TREE);
506 /* Return the type for the clast_term T used in STMT. */
509 gcc_type_for_clast_term (struct clast_term *t,
510 sese region, VEC (tree, heap) *newivs,
511 htab_t newivs_index, htab_t params_index)
513 gcc_assert (t->expr.type == expr_term);
516 return gcc_type_for_value (t->val);
518 return TREE_TYPE (clast_name_to_gcc (t->var, region, newivs,
519 newivs_index, params_index));
523 gcc_type_for_clast_expr (struct clast_expr *, sese,
524 VEC (tree, heap) *, htab_t, htab_t);
526 /* Return the type for the clast_reduction R used in STMT. */
529 gcc_type_for_clast_red (struct clast_reduction *r, sese region,
530 VEC (tree, heap) *newivs,
531 htab_t newivs_index, htab_t params_index)
534 tree type = NULL_TREE;
537 return gcc_type_for_clast_expr (r->elts[0], region, newivs,
538 newivs_index, params_index);
545 type = gcc_type_for_clast_expr (r->elts[0], region, newivs,
546 newivs_index, params_index);
547 for (i = 1; i < r->n; i++)
548 type = max_precision_type (type, gcc_type_for_clast_expr
549 (r->elts[i], region, newivs,
550 newivs_index, params_index));
562 /* Return the type for the clast_binary B used in STMT. */
565 gcc_type_for_clast_bin (struct clast_binary *b,
566 sese region, VEC (tree, heap) *newivs,
567 htab_t newivs_index, htab_t params_index)
569 tree l = gcc_type_for_clast_expr ((struct clast_expr *) b->LHS, region,
570 newivs, newivs_index, params_index);
571 tree r = gcc_type_for_value (b->RHS);
572 return max_signed_precision_type (l, r);
575 /* Returns the type for the CLAST expression E when used in statement
579 gcc_type_for_clast_expr (struct clast_expr *e,
580 sese region, VEC (tree, heap) *newivs,
581 htab_t newivs_index, htab_t params_index)
586 return gcc_type_for_clast_term ((struct clast_term *) e, region,
587 newivs, newivs_index, params_index);
590 return gcc_type_for_clast_red ((struct clast_reduction *) e, region,
591 newivs, newivs_index, params_index);
594 return gcc_type_for_clast_bin ((struct clast_binary *) e, region,
595 newivs, newivs_index, params_index);
604 /* Returns the type for the equation CLEQ. */
607 gcc_type_for_clast_eq (struct clast_equation *cleq,
608 sese region, VEC (tree, heap) *newivs,
609 htab_t newivs_index, htab_t params_index)
611 tree l = gcc_type_for_clast_expr (cleq->LHS, region, newivs,
612 newivs_index, params_index);
613 tree r = gcc_type_for_clast_expr (cleq->RHS, region, newivs,
614 newivs_index, params_index);
615 return max_precision_type (l, r);
618 /* Translates a clast equation CLEQ to a tree. */
621 graphite_translate_clast_equation (sese region,
622 struct clast_equation *cleq,
623 VEC (tree, heap) *newivs,
624 htab_t newivs_index, htab_t params_index)
627 tree type = gcc_type_for_clast_eq (cleq, region, newivs, newivs_index,
629 tree lhs = clast_to_gcc_expression (type, cleq->LHS, region, newivs,
630 newivs_index, params_index);
631 tree rhs = clast_to_gcc_expression (type, cleq->RHS, region, newivs,
632 newivs_index, params_index);
637 else if (cleq->sign > 0)
643 return fold_build2 (comp, boolean_type_node, lhs, rhs);
646 /* Creates the test for the condition in STMT. */
649 graphite_create_guard_cond_expr (sese region, struct clast_guard *stmt,
650 VEC (tree, heap) *newivs,
651 htab_t newivs_index, htab_t params_index)
656 for (i = 0; i < stmt->n; i++)
658 tree eq = graphite_translate_clast_equation (region, &stmt->eq[i],
659 newivs, newivs_index,
663 cond = fold_build2 (TRUTH_AND_EXPR, TREE_TYPE (eq), cond, eq);
671 /* Creates a new if region corresponding to Cloog's guard. */
674 graphite_create_new_guard (sese region, edge entry_edge,
675 struct clast_guard *stmt,
676 VEC (tree, heap) *newivs,
677 htab_t newivs_index, htab_t params_index)
679 tree cond_expr = graphite_create_guard_cond_expr (region, stmt, newivs,
680 newivs_index, params_index);
681 edge exit_edge = create_empty_if_region_on_edge (entry_edge, cond_expr);
685 /* Compute the lower bound LOW and upper bound UP for the induction
686 variable at LEVEL for the statement PBB, based on the transformed
687 scattering of PBB: T|I|G|Cst, with T the scattering transform, I
688 the iteration domain, and G the context parameters. */
691 compute_bounds_for_level (poly_bb_p pbb, int level, Value low, Value up)
693 ppl_Pointset_Powerset_C_Polyhedron_t ps;
694 ppl_Linear_Expression_t le;
696 combine_context_id_scat (&ps, pbb, false);
698 /* Prepare the linear expression corresponding to the level that we
699 want to maximize/minimize. */
701 ppl_dimension_type dim = pbb_nb_scattering_transform (pbb)
702 + pbb_dim_iter_domain (pbb) + pbb_nb_params (pbb);
704 ppl_new_Linear_Expression_with_dimension (&le, dim);
705 ppl_set_coef (le, 2 * level + 1, 1);
708 ppl_max_for_le_pointset (ps, le, up);
709 ppl_min_for_le_pointset (ps, le, low);
712 /* Compute the type for the induction variable at LEVEL for the
713 statement PBB, based on the transformed schedule of PBB. OLD_TYPE
714 is the type of the old induction variable for that loop. */
717 compute_type_for_level_1 (poly_bb_p pbb, int level, tree old_type)
725 compute_bounds_for_level (pbb, level, low, up);
726 type = gcc_type_for_interval (low, up, old_type);
733 /* Compute the type for the induction variable at LEVEL for the
734 statement PBB, based on the transformed schedule of PBB. */
737 compute_type_for_level (poly_bb_p pbb, int level)
739 tree oldiv = pbb_to_depth_to_oldiv (pbb, level);
740 tree type = TREE_TYPE (oldiv);
742 if (type && POINTER_TYPE_P (type))
744 #ifdef ENABLE_CHECKING
745 tree ctype = compute_type_for_level_1 (pbb, level, type);
747 /* In the case of a pointer type, check that after the loop
748 transform, the lower and the upper bounds of the type fit the
749 oldiv pointer type. */
750 gcc_assert (TYPE_PRECISION (type) >= TYPE_PRECISION (ctype)
751 && integer_zerop (lower_bound_in_type (ctype, ctype)));
756 return compute_type_for_level_1 (pbb, level, type);
759 /* Walks a CLAST and returns the first statement in the body of a
762 static struct clast_user_stmt *
763 clast_get_body_of_loop (struct clast_stmt *stmt)
766 || CLAST_STMT_IS_A (stmt, stmt_user))
767 return (struct clast_user_stmt *) stmt;
769 if (CLAST_STMT_IS_A (stmt, stmt_for))
770 return clast_get_body_of_loop (((struct clast_for *) stmt)->body);
772 if (CLAST_STMT_IS_A (stmt, stmt_guard))
773 return clast_get_body_of_loop (((struct clast_guard *) stmt)->then);
775 if (CLAST_STMT_IS_A (stmt, stmt_block))
776 return clast_get_body_of_loop (((struct clast_block *) stmt)->body);
781 /* Returns the type for the induction variable for the loop translated
785 gcc_type_for_iv_of_clast_loop (struct clast_for *stmt_for, int level,
786 tree lb_type, tree ub_type)
788 struct clast_stmt *stmt = (struct clast_stmt *) stmt_for;
789 struct clast_user_stmt *body = clast_get_body_of_loop (stmt);
790 CloogStatement *cs = body->statement;
791 poly_bb_p pbb = (poly_bb_p) cloog_statement_usr (cs);
793 return max_precision_type (lb_type, max_precision_type
794 (ub_type, compute_type_for_level (pbb,
798 /* Creates a new LOOP corresponding to Cloog's STMT. Inserts an
799 induction variable for the new LOOP. New LOOP is attached to CFG
800 starting at ENTRY_EDGE. LOOP is inserted into the loop tree and
801 becomes the child loop of the OUTER_LOOP. NEWIVS_INDEX binds
802 CLooG's scattering name to the induction variable created for the
803 loop of STMT. The new induction variable is inserted in the NEWIVS
807 graphite_create_new_loop (sese region, edge entry_edge,
808 struct clast_for *stmt,
809 loop_p outer, VEC (tree, heap) **newivs,
810 htab_t newivs_index, htab_t params_index, int level)
812 tree lb_type = gcc_type_for_clast_expr (stmt->LB, region, *newivs,
813 newivs_index, params_index);
814 tree ub_type = gcc_type_for_clast_expr (stmt->UB, region, *newivs,
815 newivs_index, params_index);
816 tree type = gcc_type_for_iv_of_clast_loop (stmt, level, lb_type, ub_type);
817 tree lb = clast_to_gcc_expression (type, stmt->LB, region, *newivs,
818 newivs_index, params_index);
819 tree ub = clast_to_gcc_expression (type, stmt->UB, region, *newivs,
820 newivs_index, params_index);
821 tree stride = gmp_cst_to_tree (type, stmt->stride);
822 tree ivvar = create_tmp_var (type, "graphite_IV");
823 tree iv, iv_after_increment;
824 loop_p loop = create_empty_loop_on_edge
825 (entry_edge, lb, stride, ub, ivvar, &iv, &iv_after_increment,
826 outer ? outer : entry_edge->src->loop_father);
828 add_referenced_var (ivvar);
830 save_clast_name_index (newivs_index, stmt->iterator,
831 VEC_length (tree, *newivs));
832 VEC_safe_push (tree, heap, *newivs, iv);
836 /* Inserts in MAP a tuple (OLD_NAME, NEW_NAME) for the induction
837 variables of the loops around GBB in SESE. */
840 build_iv_mapping (htab_t map, sese region,
841 VEC (tree, heap) *newivs, htab_t newivs_index,
842 struct clast_user_stmt *user_stmt,
845 struct clast_stmt *t;
847 CloogStatement *cs = user_stmt->statement;
848 poly_bb_p pbb = (poly_bb_p) cloog_statement_usr (cs);
850 for (t = user_stmt->substitutions; t; t = t->next, index++)
852 struct clast_expr *expr = (struct clast_expr *)
853 ((struct clast_assignment *)t)->RHS;
854 tree type = gcc_type_for_clast_expr (expr, region, newivs,
855 newivs_index, params_index);
856 tree old_name = pbb_to_depth_to_oldiv (pbb, index);
857 tree e = clast_to_gcc_expression (type, expr, region, newivs,
858 newivs_index, params_index);
859 set_rename (map, old_name, e);
863 /* Helper function for htab_traverse. */
866 copy_renames (void **slot, void *s)
868 struct rename_map_elt_s *entry = (struct rename_map_elt_s *) *slot;
869 htab_t res = (htab_t) s;
870 tree old_name = entry->old_name;
871 tree expr = entry->expr;
872 struct rename_map_elt_s tmp;
875 tmp.old_name = old_name;
876 x = htab_find_slot (res, &tmp, INSERT);
879 *x = new_rename_map_elt (old_name, expr);
884 /* Construct bb_pbb_def with BB and PBB. */
887 new_bb_pbb_def (basic_block bb, poly_bb_p pbb)
889 bb_pbb_def *bb_pbb_p;
891 bb_pbb_p = XNEW (bb_pbb_def);
898 /* Mark BB with it's relevant PBB via hashing table BB_PBB_MAPPING. */
901 mark_bb_with_pbb (poly_bb_p pbb, basic_block bb, htab_t bb_pbb_mapping)
907 x = htab_find_slot (bb_pbb_mapping, &tmp, INSERT);
910 *x = new_bb_pbb_def (bb, pbb);
913 /* Find BB's related poly_bb_p in hash table BB_PBB_MAPPING. */
916 find_pbb_via_hash (htab_t bb_pbb_mapping, basic_block bb)
922 slot = htab_find_slot (bb_pbb_mapping, &tmp, NO_INSERT);
925 return ((bb_pbb_def *) *slot)->pbb;
930 /* Check data dependency in LOOP at scattering level LEVEL.
931 BB_PBB_MAPPING is a basic_block and it's related poly_bb_p
935 dependency_in_loop_p (loop_p loop, htab_t bb_pbb_mapping, int level)
938 basic_block *bbs = get_loop_body_in_dom_order (loop);
940 for (i = 0; i < loop->num_nodes; i++)
942 poly_bb_p pbb1 = find_pbb_via_hash (bb_pbb_mapping, bbs[i]);
947 for (j = 0; j < loop->num_nodes; j++)
949 poly_bb_p pbb2 = find_pbb_via_hash (bb_pbb_mapping, bbs[j]);
954 if (dependency_between_pbbs_p (pbb1, pbb2, level))
968 translate_clast (sese, loop_p, struct clast_stmt *, edge, htab_t,
969 VEC (tree, heap) **, htab_t, htab_t, int, htab_t);
971 /* Translates a clast user statement STMT to gimple.
973 - REGION is the sese region we used to generate the scop.
974 - NEXT_E is the edge where new generated code should be attached.
975 - CONTEXT_LOOP is the loop in which the generated code will be placed
976 - RENAME_MAP contains a set of tuples of new names associated to
977 the original variables names.
978 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
979 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
982 translate_clast_user (sese region, struct clast_user_stmt *stmt, edge next_e,
983 htab_t rename_map, VEC (tree, heap) **newivs,
984 htab_t newivs_index, htab_t bb_pbb_mapping,
989 poly_bb_p pbb = (poly_bb_p) cloog_statement_usr (stmt->statement);
990 gbb = PBB_BLACK_BOX (pbb);
992 if (GBB_BB (gbb) == ENTRY_BLOCK_PTR)
995 build_iv_mapping (rename_map, region, *newivs, newivs_index, stmt,
997 next_e = copy_bb_and_scalar_dependences (GBB_BB (gbb), region,
999 new_bb = next_e->src;
1000 mark_bb_with_pbb (pbb, new_bb, bb_pbb_mapping);
1001 update_ssa (TODO_update_ssa);
1006 /* Creates a new if region protecting the loop to be executed, if the execution
1007 count is zero (lb > ub). */
1009 graphite_create_new_loop_guard (sese region, edge entry_edge,
1010 struct clast_for *stmt,
1011 VEC (tree, heap) *newivs,
1012 htab_t newivs_index, htab_t params_index)
1016 tree lb_type = gcc_type_for_clast_expr (stmt->LB, region, newivs,
1017 newivs_index, params_index);
1018 tree ub_type = gcc_type_for_clast_expr (stmt->UB, region, newivs,
1019 newivs_index, params_index);
1020 tree type = max_precision_type (lb_type, ub_type);
1021 tree lb = clast_to_gcc_expression (type, stmt->LB, region, newivs,
1022 newivs_index, params_index);
1023 tree ub = clast_to_gcc_expression (type, stmt->UB, region, newivs,
1024 newivs_index, params_index);
1026 /* XXX: Adding +1 and using LT_EXPR helps with loop latches that have a
1027 loop iteration count of "PARAMETER - 1". For PARAMETER == 0 this becomes
1028 2^{32|64}, and the condition lb <= ub is true, even if we do not want this.
1029 However lb < ub + 1 is false, as expected.
1030 There might be a problem with cases where ub is 2^32. */
1033 value_init (gmp_one);
1034 value_set_si (gmp_one, 1);
1035 one = gmp_cst_to_tree (type, gmp_one);
1036 value_clear (gmp_one);
1038 ub = fold_build2 (PLUS_EXPR, type, ub, one);
1039 cond_expr = fold_build2 (LT_EXPR, boolean_type_node, lb, ub);
1041 exit_edge = create_empty_if_region_on_edge (entry_edge, cond_expr);
1047 /* Create the loop for a clast for statement.
1049 - REGION is the sese region we used to generate the scop.
1050 - NEXT_E is the edge where new generated code should be attached.
1051 - RENAME_MAP contains a set of tuples of new names associated to
1052 the original variables names.
1053 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1054 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1057 translate_clast_for_loop (sese region, loop_p context_loop,
1058 struct clast_for *stmt, edge next_e,
1059 htab_t rename_map, VEC (tree, heap) **newivs,
1060 htab_t newivs_index, htab_t bb_pbb_mapping,
1061 int level, htab_t params_index)
1063 struct loop *loop = graphite_create_new_loop (region, next_e, stmt,
1064 context_loop, newivs,
1065 newivs_index, params_index,
1067 edge last_e = single_exit (loop);
1068 edge to_body = single_succ_edge (loop->header);
1069 basic_block after = to_body->dest;
1071 /* Create a basic block for loop close phi nodes. */
1072 last_e = single_succ_edge (split_edge (last_e));
1074 /* Translate the body of the loop. */
1075 next_e = translate_clast (region, loop, stmt->body, to_body, rename_map,
1076 newivs, newivs_index, bb_pbb_mapping, level + 1,
1078 redirect_edge_succ_nodup (next_e, after);
1079 set_immediate_dominator (CDI_DOMINATORS, next_e->dest, next_e->src);
1081 /* Remove from rename_map all the tuples containing variables
1082 defined in loop's body. */
1083 insert_loop_close_phis (rename_map, loop);
1085 if (flag_loop_parallelize_all
1086 && !dependency_in_loop_p (loop, bb_pbb_mapping,
1087 get_scattering_level (level)))
1088 loop->can_be_parallel = true;
1093 /* Translates a clast for statement STMT to gimple. First a guard is created
1094 protecting the loop, if it is executed zero times. In this guard we create
1095 the real loop structure.
1097 - REGION is the sese region we used to generate the scop.
1098 - NEXT_E is the edge where new generated code should be attached.
1099 - RENAME_MAP contains a set of tuples of new names associated to
1100 the original variables names.
1101 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1102 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1105 translate_clast_for (sese region, loop_p context_loop, struct clast_for *stmt,
1106 edge next_e, htab_t rename_map, VEC (tree, heap) **newivs,
1107 htab_t newivs_index, htab_t bb_pbb_mapping, int level,
1108 htab_t params_index)
1110 edge last_e = graphite_create_new_loop_guard (region, next_e, stmt, *newivs,
1111 newivs_index, params_index);
1113 edge true_e = get_true_edge_from_guard_bb (next_e->dest);
1114 edge false_e = get_false_edge_from_guard_bb (next_e->dest);
1115 edge exit_true_e = single_succ_edge (true_e->dest);
1116 edge exit_false_e = single_succ_edge (false_e->dest);
1118 htab_t before_guard = htab_create (10, rename_map_elt_info,
1119 eq_rename_map_elts, free);
1120 htab_traverse (rename_map, copy_renames, before_guard);
1122 next_e = translate_clast_for_loop (region, context_loop, stmt, true_e,
1124 newivs_index, bb_pbb_mapping, level,
1127 insert_guard_phis (last_e->src, exit_true_e, exit_false_e,
1128 before_guard, rename_map);
1130 htab_delete (before_guard);
1135 /* Translates a clast guard statement STMT to gimple.
1137 - REGION is the sese region we used to generate the scop.
1138 - NEXT_E is the edge where new generated code should be attached.
1139 - CONTEXT_LOOP is the loop in which the generated code will be placed
1140 - RENAME_MAP contains a set of tuples of new names associated to
1141 the original variables names.
1142 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1143 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1146 translate_clast_guard (sese region, loop_p context_loop,
1147 struct clast_guard *stmt, edge next_e,
1148 htab_t rename_map, VEC (tree, heap) **newivs,
1149 htab_t newivs_index, htab_t bb_pbb_mapping, int level,
1150 htab_t params_index)
1152 edge last_e = graphite_create_new_guard (region, next_e, stmt, *newivs,
1153 newivs_index, params_index);
1155 edge true_e = get_true_edge_from_guard_bb (next_e->dest);
1156 edge false_e = get_false_edge_from_guard_bb (next_e->dest);
1157 edge exit_true_e = single_succ_edge (true_e->dest);
1158 edge exit_false_e = single_succ_edge (false_e->dest);
1160 htab_t before_guard = htab_create (10, rename_map_elt_info,
1161 eq_rename_map_elts, free);
1162 htab_traverse (rename_map, copy_renames, before_guard);
1164 next_e = translate_clast (region, context_loop, stmt->then, true_e,
1165 rename_map, newivs, newivs_index, bb_pbb_mapping,
1166 level, params_index);
1168 insert_guard_phis (last_e->src, exit_true_e, exit_false_e,
1169 before_guard, rename_map);
1171 htab_delete (before_guard);
1176 /* Translates a CLAST statement STMT to GCC representation in the
1179 - NEXT_E is the edge where new generated code should be attached.
1180 - CONTEXT_LOOP is the loop in which the generated code will be placed
1181 - RENAME_MAP contains a set of tuples of new names associated to
1182 the original variables names.
1183 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping. */
1185 translate_clast (sese region, loop_p context_loop, struct clast_stmt *stmt,
1186 edge next_e, htab_t rename_map, VEC (tree, heap) **newivs,
1187 htab_t newivs_index, htab_t bb_pbb_mapping, int level,
1188 htab_t params_index)
1193 if (CLAST_STMT_IS_A (stmt, stmt_root))
1196 else if (CLAST_STMT_IS_A (stmt, stmt_user))
1197 next_e = translate_clast_user (region, (struct clast_user_stmt *) stmt,
1198 next_e, rename_map, newivs, newivs_index,
1199 bb_pbb_mapping, params_index);
1201 else if (CLAST_STMT_IS_A (stmt, stmt_for))
1202 next_e = translate_clast_for (region, context_loop,
1203 (struct clast_for *) stmt, next_e,
1204 rename_map, newivs, newivs_index,
1205 bb_pbb_mapping, level, params_index);
1207 else if (CLAST_STMT_IS_A (stmt, stmt_guard))
1208 next_e = translate_clast_guard (region, context_loop,
1209 (struct clast_guard *) stmt, next_e,
1210 rename_map, newivs, newivs_index,
1211 bb_pbb_mapping, level, params_index);
1213 else if (CLAST_STMT_IS_A (stmt, stmt_block))
1214 next_e = translate_clast (region, context_loop,
1215 ((struct clast_block *) stmt)->body,
1216 next_e, rename_map, newivs, newivs_index,
1217 bb_pbb_mapping, level, params_index);
1221 recompute_all_dominators ();
1224 return translate_clast (region, context_loop, stmt->next, next_e,
1225 rename_map, newivs, newivs_index,
1226 bb_pbb_mapping, level, params_index);
1229 /* Free the SCATTERING domain list. */
1232 free_scattering (CloogDomainList *scattering)
1236 CloogDomain *dom = cloog_domain (scattering);
1237 CloogDomainList *next = cloog_next_domain (scattering);
1239 cloog_domain_free (dom);
1245 /* Initialize Cloog's parameter names from the names used in GIMPLE.
1246 Initialize Cloog's iterator names, using 'graphite_iterator_%d'
1247 from 0 to scop_nb_loops (scop). */
1250 initialize_cloog_names (scop_p scop, CloogProgram *prog)
1252 sese region = SCOP_REGION (scop);
1254 int nb_iterators = scop_max_loop_depth (scop);
1255 int nb_scattering = cloog_program_nb_scattdims (prog);
1256 int nb_parameters = VEC_length (tree, SESE_PARAMS (region));
1257 char **iterators = XNEWVEC (char *, nb_iterators * 2);
1258 char **scattering = XNEWVEC (char *, nb_scattering);
1259 char **parameters= XNEWVEC (char *, nb_parameters);
1261 cloog_program_set_names (prog, cloog_names_malloc ());
1263 for (i = 0; i < nb_parameters; i++)
1265 tree param = VEC_index (tree, SESE_PARAMS(region), i);
1266 const char *name = get_name (param);
1272 len = strlen (name);
1274 parameters[i] = XNEWVEC (char, len + 1);
1275 snprintf (parameters[i], len, "%s_%d", name, SSA_NAME_VERSION (param));
1278 cloog_names_set_nb_parameters (cloog_program_names (prog), nb_parameters);
1279 cloog_names_set_parameters (cloog_program_names (prog), parameters);
1281 for (i = 0; i < nb_iterators; i++)
1284 iterators[i] = XNEWVEC (char, len);
1285 snprintf (iterators[i], len, "git_%d", i);
1288 cloog_names_set_nb_iterators (cloog_program_names (prog),
1290 cloog_names_set_iterators (cloog_program_names (prog),
1293 for (i = 0; i < nb_scattering; i++)
1296 scattering[i] = XNEWVEC (char, len);
1297 snprintf (scattering[i], len, "scat_%d", i);
1300 cloog_names_set_nb_scattering (cloog_program_names (prog),
1302 cloog_names_set_scattering (cloog_program_names (prog),
1306 /* Build cloog program for SCoP. */
1309 build_cloog_prog (scop_p scop, CloogProgram *prog)
1312 int max_nb_loops = scop_max_loop_depth (scop);
1314 CloogLoop *loop_list = NULL;
1315 CloogBlockList *block_list = NULL;
1316 CloogDomainList *scattering = NULL;
1317 int nbs = 2 * max_nb_loops + 1;
1320 cloog_program_set_context
1321 (prog, new_Cloog_Domain_from_ppl_Pointset_Powerset (SCOP_CONTEXT (scop)));
1322 nbs = unify_scattering_dimensions (scop);
1323 scaldims = (int *) xmalloc (nbs * (sizeof (int)));
1324 cloog_program_set_nb_scattdims (prog, nbs);
1325 initialize_cloog_names (scop, prog);
1327 for (i = 0; VEC_iterate (poly_bb_p, SCOP_BBS (scop), i, pbb); i++)
1329 CloogStatement *stmt;
1332 /* Dead code elimination: when the domain of a PBB is empty,
1333 don't generate code for the PBB. */
1334 if (ppl_Pointset_Powerset_C_Polyhedron_is_empty (PBB_DOMAIN (pbb)))
1337 /* Build the new statement and its block. */
1338 stmt = cloog_statement_alloc (pbb_index (pbb));
1339 block = cloog_block_alloc (stmt, 0, NULL, pbb_dim_iter_domain (pbb));
1340 cloog_statement_set_usr (stmt, pbb);
1342 /* Build loop list. */
1344 CloogLoop *new_loop_list = cloog_loop_malloc ();
1345 cloog_loop_set_next (new_loop_list, loop_list);
1346 cloog_loop_set_domain
1348 new_Cloog_Domain_from_ppl_Pointset_Powerset (PBB_DOMAIN (pbb)));
1349 cloog_loop_set_block (new_loop_list, block);
1350 loop_list = new_loop_list;
1353 /* Build block list. */
1355 CloogBlockList *new_block_list = cloog_block_list_malloc ();
1357 cloog_block_list_set_next (new_block_list, block_list);
1358 cloog_block_list_set_block (new_block_list, block);
1359 block_list = new_block_list;
1362 /* Build scattering list. */
1364 /* XXX: Replace with cloog_domain_list_alloc(), when available. */
1365 CloogDomainList *new_scattering
1366 = (CloogDomainList *) xmalloc (sizeof (CloogDomainList));
1367 ppl_Polyhedron_t scat;
1370 scat = PBB_TRANSFORMED_SCATTERING (pbb);
1371 dom = new_Cloog_Domain_from_ppl_Polyhedron (scat);
1373 cloog_set_next_domain (new_scattering, scattering);
1374 cloog_set_domain (new_scattering, dom);
1375 scattering = new_scattering;
1379 cloog_program_set_loop (prog, loop_list);
1380 cloog_program_set_blocklist (prog, block_list);
1382 for (i = 0; i < nbs; i++)
1385 cloog_program_set_scaldims (prog, scaldims);
1387 /* Extract scalar dimensions to simplify the code generation problem. */
1388 cloog_program_extract_scalars (prog, scattering);
1390 /* Apply scattering. */
1391 cloog_program_scatter (prog, scattering);
1392 free_scattering (scattering);
1394 /* Iterators corresponding to scalar dimensions have to be extracted. */
1395 cloog_names_scalarize (cloog_program_names (prog), nbs,
1396 cloog_program_scaldims (prog));
1398 /* Free blocklist. */
1400 CloogBlockList *next = cloog_program_blocklist (prog);
1404 CloogBlockList *toDelete = next;
1405 next = cloog_block_list_next (next);
1406 cloog_block_list_set_next (toDelete, NULL);
1407 cloog_block_list_set_block (toDelete, NULL);
1408 cloog_block_list_free (toDelete);
1410 cloog_program_set_blocklist (prog, NULL);
1414 /* Return the options that will be used in GLOOG. */
1416 static CloogOptions *
1417 set_cloog_options (void)
1419 CloogOptions *options = cloog_options_malloc ();
1421 /* Change cloog output language to C. If we do use FORTRAN instead, cloog
1422 will stop e.g. with "ERROR: unbounded loops not allowed in FORTRAN.", if
1423 we pass an incomplete program to cloog. */
1424 options->language = LANGUAGE_C;
1426 /* Enable complex equality spreading: removes dummy statements
1427 (assignments) in the generated code which repeats the
1428 substitution equations for statements. This is useless for
1432 /* Enable C pretty-printing mode: normalizes the substitution
1433 equations for statements. */
1436 /* Allow cloog to build strides with a stride width different to one.
1437 This example has stride = 4:
1439 for (i = 0; i < 20; i += 4)
1441 options->strides = 1;
1443 /* Disable optimizations and make cloog generate source code closer to the
1444 input. This is useful for debugging, but later we want the optimized
1447 XXX: We can not disable optimizations, as loop blocking is not working
1452 options->l = INT_MAX;
1458 /* Prints STMT to STDERR. */
1461 print_clast_stmt (FILE *file, struct clast_stmt *stmt)
1463 CloogOptions *options = set_cloog_options ();
1465 pprint (file, stmt, 0, options);
1466 cloog_options_free (options);
1469 /* Prints STMT to STDERR. */
1472 debug_clast_stmt (struct clast_stmt *stmt)
1474 print_clast_stmt (stderr, stmt);
1477 /* Translate SCOP to a CLooG program and clast. These two
1478 representations should be freed together: a clast cannot be used
1479 without a program. */
1482 scop_to_clast (scop_p scop)
1484 CloogOptions *options = set_cloog_options ();
1485 cloog_prog_clast pc;
1487 /* Connect new cloog prog generation to graphite. */
1488 pc.prog = cloog_program_malloc ();
1489 build_cloog_prog (scop, pc.prog);
1490 pc.prog = cloog_program_generate (pc.prog, options);
1491 pc.stmt = cloog_clast_create (pc.prog, options);
1493 cloog_options_free (options);
1497 /* Prints to FILE the code generated by CLooG for SCOP. */
1500 print_generated_program (FILE *file, scop_p scop)
1502 CloogOptions *options = set_cloog_options ();
1503 cloog_prog_clast pc = scop_to_clast (scop);
1505 fprintf (file, " (prog: \n");
1506 cloog_program_print (file, pc.prog);
1507 fprintf (file, " )\n");
1509 fprintf (file, " (clast: \n");
1510 pprint (file, pc.stmt, 0, options);
1511 fprintf (file, " )\n");
1513 cloog_options_free (options);
1514 cloog_clast_free (pc.stmt);
1515 cloog_program_free (pc.prog);
1518 /* Prints to STDERR the code generated by CLooG for SCOP. */
1521 debug_generated_program (scop_p scop)
1523 print_generated_program (stderr, scop);
1526 /* Add CLooG names to parameter index. The index is used to translate
1527 back from CLooG names to GCC trees. */
1530 create_params_index (htab_t index_table, CloogProgram *prog) {
1531 CloogNames* names = cloog_program_names (prog);
1532 int nb_parameters = cloog_names_nb_parameters (names);
1533 char **parameters = cloog_names_parameters (names);
1536 for (i = 0; i < nb_parameters; i++)
1537 save_clast_name_index (index_table, parameters[i], i);
1540 /* GIMPLE Loop Generator: generates loops from STMT in GIMPLE form for
1541 the given SCOP. Return true if code generation succeeded.
1542 BB_PBB_MAPPING is a basic_block and it's related poly_bb_p mapping.
1546 gloog (scop_p scop, VEC (scop_p, heap) *scops, htab_t bb_pbb_mapping)
1548 VEC (tree, heap) *newivs = VEC_alloc (tree, heap, 10);
1549 loop_p context_loop;
1550 sese region = SCOP_REGION (scop);
1551 ifsese if_region = NULL;
1552 htab_t rename_map, newivs_index, params_index;
1553 cloog_prog_clast pc;
1556 timevar_push (TV_GRAPHITE_CODE_GEN);
1557 gloog_error = false;
1559 pc = scop_to_clast (scop);
1561 if (dump_file && (dump_flags & TDF_DETAILS))
1563 fprintf (dump_file, "\nCLAST generated by CLooG: \n");
1564 print_clast_stmt (dump_file, pc.stmt);
1565 fprintf (dump_file, "\n");
1568 recompute_all_dominators ();
1571 if_region = move_sese_in_condition (region);
1572 sese_insert_phis_for_liveouts (region,
1573 if_region->region->exit->src,
1574 if_region->false_region->exit,
1575 if_region->true_region->exit);
1576 recompute_all_dominators ();
1579 context_loop = SESE_ENTRY (region)->src->loop_father;
1580 rename_map = htab_create (10, rename_map_elt_info, eq_rename_map_elts, free);
1581 newivs_index = htab_create (10, clast_name_index_elt_info,
1582 eq_clast_name_indexes, free);
1583 params_index = htab_create (10, clast_name_index_elt_info,
1584 eq_clast_name_indexes, free);
1586 create_params_index (params_index, pc.prog);
1588 translate_clast (region, context_loop, pc.stmt,
1589 if_region->true_region->entry,
1590 rename_map, &newivs, newivs_index,
1591 bb_pbb_mapping, 1, params_index);
1593 sese_adjust_liveout_phis (region, rename_map,
1594 if_region->region->exit->src,
1595 if_region->false_region->exit,
1596 if_region->true_region->exit);
1598 rename_nb_iterations (rename_map);
1600 for (i = 0; VEC_iterate (scop_p, scops, i, scop); i++)
1601 rename_sese_parameters (rename_map, SCOP_REGION (scop));
1603 recompute_all_dominators ();
1607 set_ifsese_condition (if_region, integer_zero_node);
1609 free (if_region->true_region);
1610 free (if_region->region);
1613 htab_delete (rename_map);
1614 htab_delete (newivs_index);
1615 htab_delete (params_index);
1616 VEC_free (tree, heap, newivs);
1617 cloog_clast_free (pc.stmt);
1618 cloog_program_free (pc.prog);
1619 timevar_pop (TV_GRAPHITE_CODE_GEN);
1621 if (dump_file && (dump_flags & TDF_DETAILS))
1625 int num_no_dependency = 0;
1627 FOR_EACH_LOOP (li, loop, 0)
1628 if (loop->can_be_parallel)
1629 num_no_dependency++;
1631 fprintf (dump_file, "\n%d loops carried no dependency.\n",
1635 return !gloog_error;