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);
238 precision = TYPE_UNSIGNED (type1) ? p1 * 2 : p1;
240 precision = TYPE_UNSIGNED (type2) ? p2 * 2 : p2;
242 type = lang_hooks.types.type_for_size (precision, false);
247 return integer_type_node;
252 /* Returns the maximal precision type for expressions TYPE1 and TYPE2. */
255 max_precision_type (tree type1, tree type2)
257 if (POINTER_TYPE_P (type1))
260 if (POINTER_TYPE_P (type2))
263 if (!TYPE_UNSIGNED (type1)
264 || !TYPE_UNSIGNED (type2))
265 return max_signed_precision_type (type1, type2);
267 return TYPE_PRECISION (type1) > TYPE_PRECISION (type2) ? type1 : type2;
271 clast_to_gcc_expression (tree, struct clast_expr *, sese, VEC (tree, heap) *,
274 /* Converts a Cloog reduction expression R with reduction operation OP
275 to a GCC expression tree of type TYPE. */
278 clast_to_gcc_expression_red (tree type, enum tree_code op,
279 struct clast_reduction *r,
280 sese region, VEC (tree, heap) *newivs,
281 htab_t newivs_index, htab_t params_index)
284 tree res = clast_to_gcc_expression (type, r->elts[0], region, newivs,
285 newivs_index, params_index);
286 tree operand_type = (op == POINTER_PLUS_EXPR) ? sizetype : type;
288 for (i = 1; i < r->n; i++)
290 tree t = clast_to_gcc_expression (operand_type, r->elts[i], region,
291 newivs, newivs_index, params_index);
292 res = fold_build2 (op, type, res, t);
298 /* Converts a Cloog AST expression E back to a GCC expression tree of
302 clast_to_gcc_expression (tree type, struct clast_expr *e,
303 sese region, VEC (tree, heap) *newivs,
304 htab_t newivs_index, htab_t params_index)
310 struct clast_term *t = (struct clast_term *) e;
314 if (mpz_cmp_si (t->val, 1) == 0)
316 tree name = clast_name_to_gcc (t->var, region, newivs,
317 newivs_index, params_index);
319 if (POINTER_TYPE_P (TREE_TYPE (name)) != POINTER_TYPE_P (type))
320 name = fold_convert (sizetype, name);
322 name = fold_convert (type, name);
326 else if (mpz_cmp_si (t->val, -1) == 0)
328 tree name = clast_name_to_gcc (t->var, region, newivs,
329 newivs_index, params_index);
331 if (POINTER_TYPE_P (TREE_TYPE (name)) != POINTER_TYPE_P (type))
332 name = fold_convert (sizetype, name);
334 name = fold_convert (type, name);
336 return fold_build1 (NEGATE_EXPR, type, name);
340 tree name = clast_name_to_gcc (t->var, region, newivs,
341 newivs_index, params_index);
342 tree cst = gmp_cst_to_tree (type, t->val);
344 if (POINTER_TYPE_P (TREE_TYPE (name)) != POINTER_TYPE_P (type))
345 name = fold_convert (sizetype, name);
347 name = fold_convert (type, name);
349 if (!POINTER_TYPE_P (type))
350 return fold_build2 (MULT_EXPR, type, cst, name);
357 return gmp_cst_to_tree (type, t->val);
362 struct clast_reduction *r = (struct clast_reduction *) e;
367 return clast_to_gcc_expression_red
368 (type, POINTER_TYPE_P (type) ? POINTER_PLUS_EXPR : PLUS_EXPR,
369 r, region, newivs, newivs_index, params_index);
372 return clast_to_gcc_expression_red (type, MIN_EXPR, r, region,
373 newivs, newivs_index,
377 return clast_to_gcc_expression_red (type, MAX_EXPR, r, region,
378 newivs, newivs_index,
389 struct clast_binary *b = (struct clast_binary *) e;
390 struct clast_expr *lhs = (struct clast_expr *) b->LHS;
391 tree tl = clast_to_gcc_expression (type, lhs, region, newivs,
392 newivs_index, params_index);
393 tree tr = gmp_cst_to_tree (type, b->RHS);
398 return fold_build2 (FLOOR_DIV_EXPR, type, tl, tr);
401 return fold_build2 (CEIL_DIV_EXPR, type, tl, tr);
404 return fold_build2 (EXACT_DIV_EXPR, type, tl, tr);
407 return fold_build2 (TRUNC_MOD_EXPR, type, tl, tr);
421 /* Return the precision needed to represent the value VAL. */
424 precision_for_value (mpz_t val)
440 while (mpz_cmp (y, x) > 0)
453 /* Return the precision needed to represent the values between LOW and
457 precision_for_interval (mpz_t low, mpz_t up)
462 gcc_assert (mpz_cmp (low, up) <= 0);
465 mpz_sub (diff, up, low);
466 precision = precision_for_value (diff);
472 /* Return a type that could represent the integer value VAL. */
475 gcc_type_for_interval (mpz_t low, mpz_t up)
477 bool unsigned_p = true;
478 int precision, prec_up, prec_int;
480 enum machine_mode mode;
482 gcc_assert (mpz_cmp (low, up) <= 0);
484 if (mpz_sgn (low) < 0)
487 prec_up = precision_for_value (up);
488 prec_int = precision_for_interval (low, up);
489 precision = MAX (prec_up, prec_int);
491 if (precision > BITS_PER_WORD)
494 return integer_type_node;
497 mode = smallest_mode_for_size (precision, MODE_INT);
498 precision = GET_MODE_PRECISION (mode);
499 type = build_nonstandard_integer_type (precision, unsigned_p);
504 return integer_type_node;
510 /* Return a type that could represent the integer value VAL, or
511 otherwise return NULL_TREE. */
514 gcc_type_for_value (mpz_t val)
516 return gcc_type_for_interval (val, val);
519 /* Return the type for the clast_term T used in STMT. */
522 gcc_type_for_clast_term (struct clast_term *t,
523 sese region, VEC (tree, heap) *newivs,
524 htab_t newivs_index, htab_t params_index)
526 gcc_assert (t->expr.type == expr_term);
529 return gcc_type_for_value (t->val);
531 return TREE_TYPE (clast_name_to_gcc (t->var, region, newivs,
532 newivs_index, params_index));
536 gcc_type_for_clast_expr (struct clast_expr *, sese,
537 VEC (tree, heap) *, htab_t, htab_t);
539 /* Return the type for the clast_reduction R used in STMT. */
542 gcc_type_for_clast_red (struct clast_reduction *r, sese region,
543 VEC (tree, heap) *newivs,
544 htab_t newivs_index, htab_t params_index)
547 tree type = NULL_TREE;
550 return gcc_type_for_clast_expr (r->elts[0], region, newivs,
551 newivs_index, params_index);
558 type = gcc_type_for_clast_expr (r->elts[0], region, newivs,
559 newivs_index, params_index);
560 for (i = 1; i < r->n; i++)
561 type = max_precision_type (type, gcc_type_for_clast_expr
562 (r->elts[i], region, newivs,
563 newivs_index, params_index));
575 /* Return the type for the clast_binary B used in STMT. */
578 gcc_type_for_clast_bin (struct clast_binary *b,
579 sese region, VEC (tree, heap) *newivs,
580 htab_t newivs_index, htab_t params_index)
582 tree l = gcc_type_for_clast_expr ((struct clast_expr *) b->LHS, region,
583 newivs, newivs_index, params_index);
584 tree r = gcc_type_for_value (b->RHS);
585 return max_signed_precision_type (l, r);
588 /* Returns the type for the CLAST expression E when used in statement
592 gcc_type_for_clast_expr (struct clast_expr *e,
593 sese region, VEC (tree, heap) *newivs,
594 htab_t newivs_index, htab_t params_index)
599 return gcc_type_for_clast_term ((struct clast_term *) e, region,
600 newivs, newivs_index, params_index);
603 return gcc_type_for_clast_red ((struct clast_reduction *) e, region,
604 newivs, newivs_index, params_index);
607 return gcc_type_for_clast_bin ((struct clast_binary *) e, region,
608 newivs, newivs_index, params_index);
617 /* Returns the type for the equation CLEQ. */
620 gcc_type_for_clast_eq (struct clast_equation *cleq,
621 sese region, VEC (tree, heap) *newivs,
622 htab_t newivs_index, htab_t params_index)
624 tree l = gcc_type_for_clast_expr (cleq->LHS, region, newivs,
625 newivs_index, params_index);
626 tree r = gcc_type_for_clast_expr (cleq->RHS, region, newivs,
627 newivs_index, params_index);
628 return max_precision_type (l, r);
631 /* Translates a clast equation CLEQ to a tree. */
634 graphite_translate_clast_equation (sese region,
635 struct clast_equation *cleq,
636 VEC (tree, heap) *newivs,
637 htab_t newivs_index, htab_t params_index)
640 tree type = gcc_type_for_clast_eq (cleq, region, newivs, newivs_index,
642 tree lhs = clast_to_gcc_expression (type, cleq->LHS, region, newivs,
643 newivs_index, params_index);
644 tree rhs = clast_to_gcc_expression (type, cleq->RHS, region, newivs,
645 newivs_index, params_index);
650 else if (cleq->sign > 0)
656 return fold_build2 (comp, boolean_type_node, lhs, rhs);
659 /* Creates the test for the condition in STMT. */
662 graphite_create_guard_cond_expr (sese region, struct clast_guard *stmt,
663 VEC (tree, heap) *newivs,
664 htab_t newivs_index, htab_t params_index)
669 for (i = 0; i < stmt->n; i++)
671 tree eq = graphite_translate_clast_equation (region, &stmt->eq[i],
672 newivs, newivs_index,
676 cond = fold_build2 (TRUTH_AND_EXPR, TREE_TYPE (eq), cond, eq);
684 /* Creates a new if region corresponding to Cloog's guard. */
687 graphite_create_new_guard (sese region, edge entry_edge,
688 struct clast_guard *stmt,
689 VEC (tree, heap) *newivs,
690 htab_t newivs_index, htab_t params_index)
692 tree cond_expr = graphite_create_guard_cond_expr (region, stmt, newivs,
693 newivs_index, params_index);
694 edge exit_edge = create_empty_if_region_on_edge (entry_edge, cond_expr);
698 /* Compute the lower bound LOW and upper bound UP for the induction
699 variable at LEVEL for the statement PBB, based on the transformed
700 scattering of PBB: T|I|G|Cst, with T the scattering transform, I
701 the iteration domain, and G the context parameters. */
704 compute_bounds_for_level (poly_bb_p pbb, int level, mpz_t low, mpz_t up)
706 ppl_Pointset_Powerset_C_Polyhedron_t ps;
707 ppl_Linear_Expression_t le;
709 combine_context_id_scat (&ps, pbb, false);
711 /* Prepare the linear expression corresponding to the level that we
712 want to maximize/minimize. */
714 ppl_dimension_type dim = pbb_nb_scattering_transform (pbb)
715 + pbb_dim_iter_domain (pbb) + pbb_nb_params (pbb);
717 ppl_new_Linear_Expression_with_dimension (&le, dim);
718 ppl_set_coef (le, 2 * level + 1, 1);
721 ppl_max_for_le_pointset (ps, le, up);
722 ppl_min_for_le_pointset (ps, le, low);
725 /* Compute the type for the induction variable at LEVEL for the
726 statement PBB, based on the transformed schedule of PBB. */
729 compute_type_for_level (poly_bb_p pbb, int level)
737 compute_bounds_for_level (pbb, level, low, up);
738 type = gcc_type_for_interval (low, up);
745 /* Walks a CLAST and returns the first statement in the body of a
748 static struct clast_user_stmt *
749 clast_get_body_of_loop (struct clast_stmt *stmt)
752 || CLAST_STMT_IS_A (stmt, stmt_user))
753 return (struct clast_user_stmt *) stmt;
755 if (CLAST_STMT_IS_A (stmt, stmt_for))
756 return clast_get_body_of_loop (((struct clast_for *) stmt)->body);
758 if (CLAST_STMT_IS_A (stmt, stmt_guard))
759 return clast_get_body_of_loop (((struct clast_guard *) stmt)->then);
761 if (CLAST_STMT_IS_A (stmt, stmt_block))
762 return clast_get_body_of_loop (((struct clast_block *) stmt)->body);
767 /* Returns the type for the induction variable for the loop translated
771 gcc_type_for_iv_of_clast_loop (struct clast_for *stmt_for, int level,
772 tree lb_type, tree ub_type)
774 struct clast_stmt *stmt = (struct clast_stmt *) stmt_for;
775 struct clast_user_stmt *body = clast_get_body_of_loop (stmt);
776 CloogStatement *cs = body->statement;
777 poly_bb_p pbb = (poly_bb_p) cloog_statement_usr (cs);
779 return max_signed_precision_type (lb_type, max_precision_type
780 (ub_type, compute_type_for_level
784 /* Creates a new LOOP corresponding to Cloog's STMT. Inserts an
785 induction variable for the new LOOP. New LOOP is attached to CFG
786 starting at ENTRY_EDGE. LOOP is inserted into the loop tree and
787 becomes the child loop of the OUTER_LOOP. NEWIVS_INDEX binds
788 CLooG's scattering name to the induction variable created for the
789 loop of STMT. The new induction variable is inserted in the NEWIVS
793 graphite_create_new_loop (sese region, edge entry_edge,
794 struct clast_for *stmt,
795 loop_p outer, VEC (tree, heap) **newivs,
796 htab_t newivs_index, htab_t params_index, int level)
798 tree lb_type = gcc_type_for_clast_expr (stmt->LB, region, *newivs,
799 newivs_index, params_index);
800 tree ub_type = gcc_type_for_clast_expr (stmt->UB, region, *newivs,
801 newivs_index, params_index);
802 tree type = gcc_type_for_iv_of_clast_loop (stmt, level, lb_type, ub_type);
803 tree lb = clast_to_gcc_expression (type, stmt->LB, region, *newivs,
804 newivs_index, params_index);
805 tree ub = clast_to_gcc_expression (type, stmt->UB, region, *newivs,
806 newivs_index, params_index);
807 tree stride = gmp_cst_to_tree (type, stmt->stride);
808 tree ivvar = create_tmp_var (type, "graphite_IV");
809 tree iv, iv_after_increment;
810 loop_p loop = create_empty_loop_on_edge
811 (entry_edge, lb, stride, ub, ivvar, &iv, &iv_after_increment,
812 outer ? outer : entry_edge->src->loop_father);
814 add_referenced_var (ivvar);
816 save_clast_name_index (newivs_index, stmt->iterator,
817 VEC_length (tree, *newivs));
818 VEC_safe_push (tree, heap, *newivs, iv);
822 /* Inserts in RENAME_MAP a tuple (OLD_NAME, NEW_NAME) for the induction
823 variables of the loops around GBB in SESE. */
826 build_iv_mapping (htab_t rename_map, sese region,
827 VEC (tree, heap) *newivs, htab_t newivs_index,
828 struct clast_user_stmt *user_stmt,
831 struct clast_stmt *t;
833 CloogStatement *cs = user_stmt->statement;
834 poly_bb_p pbb = (poly_bb_p) cloog_statement_usr (cs);
836 for (t = user_stmt->substitutions; t; t = t->next, index++)
838 struct clast_expr *expr = (struct clast_expr *)
839 ((struct clast_assignment *)t)->RHS;
840 tree type = gcc_type_for_clast_expr (expr, region, newivs,
841 newivs_index, params_index);
842 tree old_name = pbb_to_depth_to_oldiv (pbb, index);
843 tree e = clast_to_gcc_expression (type, expr, region, newivs,
844 newivs_index, params_index);
845 set_rename (rename_map, old_name, e);
849 /* Construct bb_pbb_def with BB and PBB. */
852 new_bb_pbb_def (basic_block bb, poly_bb_p pbb)
854 bb_pbb_def *bb_pbb_p;
856 bb_pbb_p = XNEW (bb_pbb_def);
863 /* Mark BB with it's relevant PBB via hashing table BB_PBB_MAPPING. */
866 mark_bb_with_pbb (poly_bb_p pbb, basic_block bb, htab_t bb_pbb_mapping)
872 x = htab_find_slot (bb_pbb_mapping, &tmp, INSERT);
875 *x = new_bb_pbb_def (bb, pbb);
878 /* Find BB's related poly_bb_p in hash table BB_PBB_MAPPING. */
881 find_pbb_via_hash (htab_t bb_pbb_mapping, basic_block bb)
887 slot = htab_find_slot (bb_pbb_mapping, &tmp, NO_INSERT);
890 return ((bb_pbb_def *) *slot)->pbb;
895 /* Check data dependency in LOOP at scattering level LEVEL.
896 BB_PBB_MAPPING is a basic_block and it's related poly_bb_p
900 dependency_in_loop_p (loop_p loop, htab_t bb_pbb_mapping, int level)
903 basic_block *bbs = get_loop_body_in_dom_order (loop);
905 for (i = 0; i < loop->num_nodes; i++)
907 poly_bb_p pbb1 = find_pbb_via_hash (bb_pbb_mapping, bbs[i]);
912 for (j = 0; j < loop->num_nodes; j++)
914 poly_bb_p pbb2 = find_pbb_via_hash (bb_pbb_mapping, bbs[j]);
919 if (dependency_between_pbbs_p (pbb1, pbb2, level))
933 translate_clast (sese, loop_p, struct clast_stmt *, edge, htab_t,
934 VEC (tree, heap) **, htab_t, htab_t, int, htab_t);
936 /* Translates a clast user statement STMT to gimple.
938 - REGION is the sese region we used to generate the scop.
939 - NEXT_E is the edge where new generated code should be attached.
940 - CONTEXT_LOOP is the loop in which the generated code will be placed
941 - RENAME_MAP contains a set of tuples of new names associated to
942 the original variables names.
943 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
944 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
947 translate_clast_user (sese region, struct clast_user_stmt *stmt, edge next_e,
948 htab_t rename_map, VEC (tree, heap) **newivs,
949 htab_t newivs_index, htab_t bb_pbb_mapping,
954 poly_bb_p pbb = (poly_bb_p) cloog_statement_usr (stmt->statement);
955 gbb = PBB_BLACK_BOX (pbb);
957 if (GBB_BB (gbb) == ENTRY_BLOCK_PTR)
960 build_iv_mapping (rename_map, region, *newivs, newivs_index, stmt,
962 next_e = copy_bb_and_scalar_dependences (GBB_BB (gbb), region,
964 new_bb = next_e->src;
965 mark_bb_with_pbb (pbb, new_bb, bb_pbb_mapping);
966 update_ssa (TODO_update_ssa);
971 /* Creates a new if region protecting the loop to be executed, if the execution
972 count is zero (lb > ub). */
975 graphite_create_new_loop_guard (sese region, edge entry_edge,
976 struct clast_for *stmt,
977 VEC (tree, heap) *newivs,
978 htab_t newivs_index, htab_t params_index)
982 tree lb_type = gcc_type_for_clast_expr (stmt->LB, region, newivs,
983 newivs_index, params_index);
984 tree ub_type = gcc_type_for_clast_expr (stmt->UB, region, newivs,
985 newivs_index, params_index);
986 tree type = max_precision_type (lb_type, ub_type);
987 tree lb = clast_to_gcc_expression (type, stmt->LB, region, newivs,
988 newivs_index, params_index);
989 tree ub = clast_to_gcc_expression (type, stmt->UB, region, newivs,
990 newivs_index, params_index);
991 tree one = POINTER_TYPE_P (type) ? size_one_node
992 : fold_convert (type, integer_one_node);
993 /* Adding +1 and using LT_EXPR helps with loop latches that have a
994 loop iteration count of "PARAMETER - 1". For PARAMETER == 0 this becomes
995 2^{32|64}, and the condition lb <= ub is true, even if we do not want this.
996 However lb < ub + 1 is false, as expected. */
997 tree ub_one = fold_build2 (POINTER_TYPE_P (type) ? POINTER_PLUS_EXPR
998 : PLUS_EXPR, type, ub, one);
1000 /* When ub + 1 wraps around, use lb <= ub. */
1001 if (integer_zerop (ub_one))
1002 cond_expr = fold_build2 (LE_EXPR, boolean_type_node, lb, ub);
1004 cond_expr = fold_build2 (LT_EXPR, boolean_type_node, lb, ub_one);
1006 exit_edge = create_empty_if_region_on_edge (entry_edge, cond_expr);
1012 /* Create the loop for a clast for statement.
1014 - REGION is the sese region we used to generate the scop.
1015 - NEXT_E is the edge where new generated code should be attached.
1016 - RENAME_MAP contains a set of tuples of new names associated to
1017 the original variables names.
1018 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1019 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1022 translate_clast_for_loop (sese region, loop_p context_loop,
1023 struct clast_for *stmt, edge next_e,
1024 htab_t rename_map, VEC (tree, heap) **newivs,
1025 htab_t newivs_index, htab_t bb_pbb_mapping,
1026 int level, htab_t params_index)
1028 struct loop *loop = graphite_create_new_loop (region, next_e, stmt,
1029 context_loop, newivs,
1030 newivs_index, params_index,
1032 edge last_e = single_exit (loop);
1033 edge to_body = single_succ_edge (loop->header);
1034 basic_block after = to_body->dest;
1036 /* Create a basic block for loop close phi nodes. */
1037 last_e = single_succ_edge (split_edge (last_e));
1039 /* Translate the body of the loop. */
1040 next_e = translate_clast (region, loop, stmt->body, to_body, rename_map,
1041 newivs, newivs_index, bb_pbb_mapping, level + 1,
1043 redirect_edge_succ_nodup (next_e, after);
1044 set_immediate_dominator (CDI_DOMINATORS, next_e->dest, next_e->src);
1046 /* Remove from rename_map all the tuples containing variables
1047 defined in loop's body. */
1048 insert_loop_close_phis (rename_map, loop);
1050 if (flag_loop_parallelize_all
1051 && !dependency_in_loop_p (loop, bb_pbb_mapping,
1052 get_scattering_level (level)))
1053 loop->can_be_parallel = true;
1058 /* Translates a clast for statement STMT to gimple. First a guard is created
1059 protecting the loop, if it is executed zero times. In this guard we create
1060 the real loop structure.
1062 - REGION is the sese region we used to generate the scop.
1063 - NEXT_E is the edge where new generated code should be attached.
1064 - RENAME_MAP contains a set of tuples of new names associated to
1065 the original variables names.
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_for (sese region, loop_p context_loop, struct clast_for *stmt,
1071 edge next_e, htab_t rename_map, VEC (tree, heap) **newivs,
1072 htab_t newivs_index, htab_t bb_pbb_mapping, int level,
1073 htab_t params_index)
1075 edge last_e = graphite_create_new_loop_guard (region, next_e, stmt, *newivs,
1076 newivs_index, params_index);
1077 edge true_e = get_true_edge_from_guard_bb (next_e->dest);
1079 translate_clast_for_loop (region, context_loop, stmt, true_e,
1081 newivs_index, bb_pbb_mapping, level,
1086 /* Translates a clast guard statement STMT to gimple.
1088 - REGION is the sese region we used to generate the scop.
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 - RENAME_MAP contains a set of tuples of new names associated to
1092 the original variables names.
1093 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping.
1094 - PARAMS_INDEX connects the cloog parameters with the gimple parameters in
1097 translate_clast_guard (sese region, loop_p context_loop,
1098 struct clast_guard *stmt, edge next_e,
1099 htab_t rename_map, VEC (tree, heap) **newivs,
1100 htab_t newivs_index, htab_t bb_pbb_mapping, int level,
1101 htab_t params_index)
1103 edge last_e = graphite_create_new_guard (region, next_e, stmt, *newivs,
1104 newivs_index, params_index);
1105 edge true_e = get_true_edge_from_guard_bb (next_e->dest);
1107 translate_clast (region, context_loop, stmt->then, true_e,
1108 rename_map, newivs, newivs_index, bb_pbb_mapping,
1109 level, params_index);
1113 /* Translates a CLAST statement STMT to GCC representation in the
1116 - NEXT_E is the edge where new generated code should be attached.
1117 - CONTEXT_LOOP is the loop in which the generated code will be placed
1118 - RENAME_MAP contains a set of tuples of new names associated to
1119 the original variables names.
1120 - BB_PBB_MAPPING is is a basic_block and it's related poly_bb_p mapping. */
1122 translate_clast (sese region, loop_p context_loop, struct clast_stmt *stmt,
1123 edge next_e, htab_t rename_map, VEC (tree, heap) **newivs,
1124 htab_t newivs_index, htab_t bb_pbb_mapping, int level,
1125 htab_t params_index)
1130 if (CLAST_STMT_IS_A (stmt, stmt_root))
1133 else if (CLAST_STMT_IS_A (stmt, stmt_user))
1134 next_e = translate_clast_user (region, (struct clast_user_stmt *) stmt,
1135 next_e, rename_map, newivs, newivs_index,
1136 bb_pbb_mapping, params_index);
1138 else if (CLAST_STMT_IS_A (stmt, stmt_for))
1139 next_e = translate_clast_for (region, context_loop,
1140 (struct clast_for *) stmt, next_e,
1141 rename_map, newivs, newivs_index,
1142 bb_pbb_mapping, level, params_index);
1144 else if (CLAST_STMT_IS_A (stmt, stmt_guard))
1145 next_e = translate_clast_guard (region, context_loop,
1146 (struct clast_guard *) stmt, next_e,
1147 rename_map, newivs, newivs_index,
1148 bb_pbb_mapping, level, params_index);
1150 else if (CLAST_STMT_IS_A (stmt, stmt_block))
1151 next_e = translate_clast (region, context_loop,
1152 ((struct clast_block *) stmt)->body,
1153 next_e, rename_map, newivs, newivs_index,
1154 bb_pbb_mapping, level, params_index);
1158 recompute_all_dominators ();
1161 return translate_clast (region, context_loop, stmt->next, next_e,
1162 rename_map, newivs, newivs_index,
1163 bb_pbb_mapping, level, params_index);
1166 /* Free the SCATTERING domain list. */
1169 free_scattering (CloogDomainList *scattering)
1173 CloogDomain *dom = cloog_domain (scattering);
1174 CloogDomainList *next = cloog_next_domain (scattering);
1176 cloog_domain_free (dom);
1182 /* Initialize Cloog's parameter names from the names used in GIMPLE.
1183 Initialize Cloog's iterator names, using 'graphite_iterator_%d'
1184 from 0 to scop_nb_loops (scop). */
1187 initialize_cloog_names (scop_p scop, CloogProgram *prog)
1189 sese region = SCOP_REGION (scop);
1191 int nb_iterators = scop_max_loop_depth (scop);
1192 int nb_scattering = cloog_program_nb_scattdims (prog);
1193 int nb_parameters = VEC_length (tree, SESE_PARAMS (region));
1194 char **iterators = XNEWVEC (char *, nb_iterators * 2);
1195 char **scattering = XNEWVEC (char *, nb_scattering);
1196 char **parameters= XNEWVEC (char *, nb_parameters);
1198 cloog_program_set_names (prog, cloog_names_malloc ());
1200 for (i = 0; i < nb_parameters; i++)
1202 tree param = VEC_index (tree, SESE_PARAMS(region), i);
1203 const char *name = get_name (param);
1209 len = strlen (name);
1211 parameters[i] = XNEWVEC (char, len + 1);
1212 snprintf (parameters[i], len, "%s_%d", name, SSA_NAME_VERSION (param));
1215 cloog_names_set_nb_parameters (cloog_program_names (prog), nb_parameters);
1216 cloog_names_set_parameters (cloog_program_names (prog), parameters);
1218 for (i = 0; i < nb_iterators; i++)
1221 iterators[i] = XNEWVEC (char, len);
1222 snprintf (iterators[i], len, "git_%d", i);
1225 cloog_names_set_nb_iterators (cloog_program_names (prog),
1227 cloog_names_set_iterators (cloog_program_names (prog),
1230 for (i = 0; i < nb_scattering; i++)
1233 scattering[i] = XNEWVEC (char, len);
1234 snprintf (scattering[i], len, "scat_%d", i);
1237 cloog_names_set_nb_scattering (cloog_program_names (prog),
1239 cloog_names_set_scattering (cloog_program_names (prog),
1243 /* Build cloog program for SCoP. */
1246 build_cloog_prog (scop_p scop, CloogProgram *prog)
1249 int max_nb_loops = scop_max_loop_depth (scop);
1251 CloogLoop *loop_list = NULL;
1252 CloogBlockList *block_list = NULL;
1253 CloogDomainList *scattering = NULL;
1254 int nbs = 2 * max_nb_loops + 1;
1257 cloog_program_set_context
1258 (prog, new_Cloog_Domain_from_ppl_Pointset_Powerset (SCOP_CONTEXT (scop)));
1259 nbs = unify_scattering_dimensions (scop);
1260 scaldims = (int *) xmalloc (nbs * (sizeof (int)));
1261 cloog_program_set_nb_scattdims (prog, nbs);
1262 initialize_cloog_names (scop, prog);
1264 for (i = 0; VEC_iterate (poly_bb_p, SCOP_BBS (scop), i, pbb); i++)
1266 CloogStatement *stmt;
1269 /* Dead code elimination: when the domain of a PBB is empty,
1270 don't generate code for the PBB. */
1271 if (ppl_Pointset_Powerset_C_Polyhedron_is_empty (PBB_DOMAIN (pbb)))
1274 /* Build the new statement and its block. */
1275 stmt = cloog_statement_alloc (pbb_index (pbb));
1276 block = cloog_block_alloc (stmt, 0, NULL, pbb_dim_iter_domain (pbb));
1277 cloog_statement_set_usr (stmt, pbb);
1279 /* Build loop list. */
1281 CloogLoop *new_loop_list = cloog_loop_malloc ();
1282 cloog_loop_set_next (new_loop_list, loop_list);
1283 cloog_loop_set_domain
1285 new_Cloog_Domain_from_ppl_Pointset_Powerset (PBB_DOMAIN (pbb)));
1286 cloog_loop_set_block (new_loop_list, block);
1287 loop_list = new_loop_list;
1290 /* Build block list. */
1292 CloogBlockList *new_block_list = cloog_block_list_malloc ();
1294 cloog_block_list_set_next (new_block_list, block_list);
1295 cloog_block_list_set_block (new_block_list, block);
1296 block_list = new_block_list;
1299 /* Build scattering list. */
1301 /* XXX: Replace with cloog_domain_list_alloc(), when available. */
1302 CloogDomainList *new_scattering
1303 = (CloogDomainList *) xmalloc (sizeof (CloogDomainList));
1304 ppl_Polyhedron_t scat;
1307 scat = PBB_TRANSFORMED_SCATTERING (pbb);
1308 dom = new_Cloog_Domain_from_ppl_Polyhedron (scat);
1310 cloog_set_next_domain (new_scattering, scattering);
1311 cloog_set_domain (new_scattering, dom);
1312 scattering = new_scattering;
1316 cloog_program_set_loop (prog, loop_list);
1317 cloog_program_set_blocklist (prog, block_list);
1319 for (i = 0; i < nbs; i++)
1322 cloog_program_set_scaldims (prog, scaldims);
1324 /* Extract scalar dimensions to simplify the code generation problem. */
1325 cloog_program_extract_scalars (prog, scattering);
1327 /* Apply scattering. */
1328 cloog_program_scatter (prog, scattering);
1329 free_scattering (scattering);
1331 /* Iterators corresponding to scalar dimensions have to be extracted. */
1332 cloog_names_scalarize (cloog_program_names (prog), nbs,
1333 cloog_program_scaldims (prog));
1335 /* Free blocklist. */
1337 CloogBlockList *next = cloog_program_blocklist (prog);
1341 CloogBlockList *toDelete = next;
1342 next = cloog_block_list_next (next);
1343 cloog_block_list_set_next (toDelete, NULL);
1344 cloog_block_list_set_block (toDelete, NULL);
1345 cloog_block_list_free (toDelete);
1347 cloog_program_set_blocklist (prog, NULL);
1351 /* Return the options that will be used in GLOOG. */
1353 static CloogOptions *
1354 set_cloog_options (void)
1356 CloogOptions *options = cloog_options_malloc ();
1358 /* Change cloog output language to C. If we do use FORTRAN instead, cloog
1359 will stop e.g. with "ERROR: unbounded loops not allowed in FORTRAN.", if
1360 we pass an incomplete program to cloog. */
1361 options->language = LANGUAGE_C;
1363 /* Enable complex equality spreading: removes dummy statements
1364 (assignments) in the generated code which repeats the
1365 substitution equations for statements. This is useless for
1369 /* Enable C pretty-printing mode: normalizes the substitution
1370 equations for statements. */
1373 /* Allow cloog to build strides with a stride width different to one.
1374 This example has stride = 4:
1376 for (i = 0; i < 20; i += 4)
1378 options->strides = 1;
1380 /* Disable optimizations and make cloog generate source code closer to the
1381 input. This is useful for debugging, but later we want the optimized
1384 XXX: We can not disable optimizations, as loop blocking is not working
1389 options->l = INT_MAX;
1395 /* Prints STMT to STDERR. */
1398 print_clast_stmt (FILE *file, struct clast_stmt *stmt)
1400 CloogOptions *options = set_cloog_options ();
1402 pprint (file, stmt, 0, options);
1403 cloog_options_free (options);
1406 /* Prints STMT to STDERR. */
1409 debug_clast_stmt (struct clast_stmt *stmt)
1411 print_clast_stmt (stderr, stmt);
1414 /* Translate SCOP to a CLooG program and clast. These two
1415 representations should be freed together: a clast cannot be used
1416 without a program. */
1419 scop_to_clast (scop_p scop)
1421 CloogOptions *options = set_cloog_options ();
1422 cloog_prog_clast pc;
1424 /* Connect new cloog prog generation to graphite. */
1425 pc.prog = cloog_program_malloc ();
1426 build_cloog_prog (scop, pc.prog);
1427 pc.prog = cloog_program_generate (pc.prog, options);
1428 pc.stmt = cloog_clast_create (pc.prog, options);
1430 cloog_options_free (options);
1434 /* Prints to FILE the code generated by CLooG for SCOP. */
1437 print_generated_program (FILE *file, scop_p scop)
1439 CloogOptions *options = set_cloog_options ();
1440 cloog_prog_clast pc = scop_to_clast (scop);
1442 fprintf (file, " (prog: \n");
1443 cloog_program_print (file, pc.prog);
1444 fprintf (file, " )\n");
1446 fprintf (file, " (clast: \n");
1447 pprint (file, pc.stmt, 0, options);
1448 fprintf (file, " )\n");
1450 cloog_options_free (options);
1451 cloog_clast_free (pc.stmt);
1452 cloog_program_free (pc.prog);
1455 /* Prints to STDERR the code generated by CLooG for SCOP. */
1458 debug_generated_program (scop_p scop)
1460 print_generated_program (stderr, scop);
1463 /* Add CLooG names to parameter index. The index is used to translate
1464 back from CLooG names to GCC trees. */
1467 create_params_index (htab_t index_table, CloogProgram *prog) {
1468 CloogNames* names = cloog_program_names (prog);
1469 int nb_parameters = cloog_names_nb_parameters (names);
1470 char **parameters = cloog_names_parameters (names);
1473 for (i = 0; i < nb_parameters; i++)
1474 save_clast_name_index (index_table, parameters[i], i);
1477 /* GIMPLE Loop Generator: generates loops from STMT in GIMPLE form for
1478 the given SCOP. Return true if code generation succeeded.
1479 BB_PBB_MAPPING is a basic_block and it's related poly_bb_p mapping.
1483 gloog (scop_p scop, htab_t bb_pbb_mapping)
1485 VEC (tree, heap) *newivs = VEC_alloc (tree, heap, 10);
1486 loop_p context_loop;
1487 sese region = SCOP_REGION (scop);
1488 ifsese if_region = NULL;
1489 htab_t rename_map, newivs_index, params_index;
1490 cloog_prog_clast pc;
1492 timevar_push (TV_GRAPHITE_CODE_GEN);
1493 gloog_error = false;
1495 pc = scop_to_clast (scop);
1497 if (dump_file && (dump_flags & TDF_DETAILS))
1499 fprintf (dump_file, "\nCLAST generated by CLooG: \n");
1500 print_clast_stmt (dump_file, pc.stmt);
1501 fprintf (dump_file, "\n");
1504 recompute_all_dominators ();
1507 if_region = move_sese_in_condition (region);
1508 sese_insert_phis_for_liveouts (region,
1509 if_region->region->exit->src,
1510 if_region->false_region->exit,
1511 if_region->true_region->exit);
1512 recompute_all_dominators ();
1515 context_loop = SESE_ENTRY (region)->src->loop_father;
1516 rename_map = htab_create (10, rename_map_elt_info, eq_rename_map_elts, free);
1517 newivs_index = htab_create (10, clast_name_index_elt_info,
1518 eq_clast_name_indexes, free);
1519 params_index = htab_create (10, clast_name_index_elt_info,
1520 eq_clast_name_indexes, free);
1522 create_params_index (params_index, pc.prog);
1524 translate_clast (region, context_loop, pc.stmt,
1525 if_region->true_region->entry,
1526 rename_map, &newivs, newivs_index,
1527 bb_pbb_mapping, 1, params_index);
1530 recompute_all_dominators ();
1534 set_ifsese_condition (if_region, integer_zero_node);
1536 free (if_region->true_region);
1537 free (if_region->region);
1540 htab_delete (rename_map);
1541 htab_delete (newivs_index);
1542 htab_delete (params_index);
1543 VEC_free (tree, heap, newivs);
1544 cloog_clast_free (pc.stmt);
1545 cloog_program_free (pc.prog);
1546 timevar_pop (TV_GRAPHITE_CODE_GEN);
1548 if (dump_file && (dump_flags & TDF_DETAILS))
1552 int num_no_dependency = 0;
1554 FOR_EACH_LOOP (li, loop, 0)
1555 if (loop->can_be_parallel)
1556 num_no_dependency++;
1558 fprintf (dump_file, "\n%d loops carried no dependency.\n",
1562 return !gloog_error;