1 /* Gimple Represented as Polyhedra.
2 Copyright (C) 2006-2015 Free Software Foundation, Inc.
3 Contributed by Sebastian Pop <sebastian.pop@inria.fr>.
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/>. */
21 /* This pass converts GIMPLE to GRAPHITE, performs some loop
22 transformations and then converts the resulting representation back
25 An early description of this pass can be found in the GCC Summit'06
26 paper "GRAPHITE: Polyhedral Analyses and Optimizations for GCC".
27 The wiki page http://gcc.gnu.org/wiki/Graphite contains pointers to
34 #include "coretypes.h"
36 #include "diagnostic-core.h"
38 #include "tree-pass.h"
40 #include "pretty-print.h"
46 #include "fold-const.h"
47 #include "gimple-iterator.h"
49 #include "tree-ssa-loop.h"
50 #include "tree-data-ref.h"
51 #include "tree-scalar-evolution.h"
53 #include "tree-parloops.h"
54 #include "tree-cfgcleanup.h"
56 #include <isl/constraint.h>
59 #include <isl/options.h>
60 #include <isl/union_map.h>
64 /* Print global statistics to FILE. */
67 print_global_statistics (FILE* file
)
72 long n_conditions
= 0;
76 long n_p_conditions
= 0;
80 FOR_ALL_BB_FN (bb
, cfun
)
82 gimple_stmt_iterator psi
;
87 /* Ignore artificial surrounding loop. */
88 if (bb
== bb
->loop_father
->header
92 n_p_loops
+= bb
->count
;
95 if (EDGE_COUNT (bb
->succs
) > 1)
98 n_p_conditions
+= bb
->count
;
101 for (psi
= gsi_start_bb (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
104 n_p_stmts
+= bb
->count
;
108 fprintf (file
, "\nGlobal statistics (");
109 fprintf (file
, "BBS:%ld, ", n_bbs
);
110 fprintf (file
, "LOOPS:%ld, ", n_loops
);
111 fprintf (file
, "CONDITIONS:%ld, ", n_conditions
);
112 fprintf (file
, "STMTS:%ld)\n", n_stmts
);
113 fprintf (file
, "\nGlobal profiling statistics (");
114 fprintf (file
, "BBS:%ld, ", n_p_bbs
);
115 fprintf (file
, "LOOPS:%ld, ", n_p_loops
);
116 fprintf (file
, "CONDITIONS:%ld, ", n_p_conditions
);
117 fprintf (file
, "STMTS:%ld)\n", n_p_stmts
);
120 /* Print statistics for SCOP to FILE. */
123 print_graphite_scop_statistics (FILE* file
, scop_p scop
)
128 long n_conditions
= 0;
132 long n_p_conditions
= 0;
136 FOR_ALL_BB_FN (bb
, cfun
)
138 gimple_stmt_iterator psi
;
139 loop_p loop
= bb
->loop_father
;
141 if (!bb_in_sese_p (bb
, scop
->scop_info
->region
))
145 n_p_bbs
+= bb
->count
;
147 if (EDGE_COUNT (bb
->succs
) > 1)
150 n_p_conditions
+= bb
->count
;
153 for (psi
= gsi_start_bb (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
156 n_p_stmts
+= bb
->count
;
159 if (loop
->header
== bb
&& loop_in_sese_p (loop
, scop
->scop_info
->region
))
162 n_p_loops
+= bb
->count
;
166 fprintf (file
, "\nFunction Name: %s\n", current_function_name ());
168 edge scop_begin
= scop
->scop_info
->region
.entry
;
169 edge scop_end
= scop
->scop_info
->region
.exit
;
171 fprintf (file
, "\nSCoP (entry_edge (bb_%d, bb_%d), ",
172 scop_begin
->src
->index
, scop_begin
->dest
->index
);
173 fprintf (file
, "exit_edge (bb_%d, bb_%d))",
174 scop_end
->src
->index
, scop_end
->dest
->index
);
176 fprintf (file
, "\nSCoP statistics (");
177 fprintf (file
, "BBS:%ld, ", n_bbs
);
178 fprintf (file
, "LOOPS:%ld, ", n_loops
);
179 fprintf (file
, "CONDITIONS:%ld, ", n_conditions
);
180 fprintf (file
, "STMTS:%ld)\n", n_stmts
);
181 fprintf (file
, "\nSCoP profiling statistics (");
182 fprintf (file
, "BBS:%ld, ", n_p_bbs
);
183 fprintf (file
, "LOOPS:%ld, ", n_p_loops
);
184 fprintf (file
, "CONDITIONS:%ld, ", n_p_conditions
);
185 fprintf (file
, "STMTS:%ld)\n", n_p_stmts
);
188 /* Print statistics for SCOPS to FILE. */
191 print_graphite_statistics (FILE* file
, vec
<scop_p
> scops
)
197 FOR_EACH_VEC_ELT (scops
, i
, scop
)
198 print_graphite_scop_statistics (file
, scop
);
200 /* Print the loop structure. */
201 print_loops (file
, 2);
202 print_loops (file
, 3);
205 /* Initialize graphite: when there are no loops returns false. */
208 graphite_initialize (isl_ctx
*ctx
)
210 int min_loops
= PARAM_VALUE (PARAM_GRAPHITE_MIN_LOOPS_PER_FUNCTION
);
211 int max_bbs
= PARAM_VALUE (PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION
);
212 int nbbs
= n_basic_blocks_for_fn (cfun
);
213 int nloops
= number_of_loops (cfun
);
215 if (nloops
<= min_loops
216 /* FIXME: This limit on the number of basic blocks of a function
217 should be removed when the SCOP detection is faster. */
220 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
222 if (nloops
<= min_loops
)
223 fprintf (dump_file
, "\nFunction does not have enough loops: "
224 "PARAM_GRAPHITE_MIN_LOOPS_PER_FUNCTION = %d.\n",
227 else if (nbbs
> max_bbs
)
228 fprintf (dump_file
, "\nFunction has too many basic blocks: "
229 "PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION = %d.\n", max_bbs
);
231 fprintf (dump_file
, "\nnumber of SCoPs: 0\n");
232 print_global_statistics (dump_file
);
240 recompute_all_dominators ();
241 initialize_original_copy_tables ();
243 if (dump_file
&& dump_flags
)
245 dump_function_to_file (current_function_decl
, dump_file
, dump_flags
);
246 print_loops (dump_file
, 3);
252 /* Finalize graphite: perform CFG cleanup when NEED_CFG_CLEANUP_P is
256 graphite_finalize (bool need_cfg_cleanup_p
)
258 free_dominance_info (CDI_POST_DOMINATORS
);
259 if (need_cfg_cleanup_p
)
261 free_dominance_info (CDI_DOMINATORS
);
264 profile_status_for_fn (cfun
) = PROFILE_ABSENT
;
265 release_recorded_exits (cfun
);
266 tree_estimate_probability ();
269 free_original_copy_tables ();
271 if (dump_file
&& dump_flags
)
272 print_loops (dump_file
, 3);
275 /* Deletes all scops in SCOPS. */
278 free_scops (vec
<scop_p
> scops
)
283 FOR_EACH_VEC_ELT (scops
, i
, scop
)
289 isl_ctx
*the_isl_ctx
;
291 /* Perform a set of linear transforms on the loops of the current
295 graphite_transform_loops (void)
299 bool need_cfg_cleanup_p
= false;
300 vec
<scop_p
> scops
= vNULL
;
303 /* If a function is parallel it was most probably already run through graphite
304 once. No need to run again. */
305 if (parallelized_function_p (cfun
->decl
))
308 ctx
= isl_ctx_alloc ();
309 isl_options_set_on_error (ctx
, ISL_ON_ERROR_ABORT
);
310 if (!graphite_initialize (ctx
))
314 build_scops (&scops
);
316 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
318 print_graphite_statistics (dump_file
, scops
);
319 print_global_statistics (dump_file
);
322 FOR_EACH_VEC_ELT (scops
, i
, scop
)
323 if (dbg_cnt (graphite_scop
))
325 scop
->isl_context
= ctx
;
326 if (!build_poly_scop (scop
))
329 if (!apply_poly_transforms (scop
))
332 need_cfg_cleanup_p
= true;
333 /* When code generation is not successful, do not continue
334 generating code for the next scops: the IR has to be cleaned up
335 and could be in an inconsistent state. */
336 if (!graphite_regenerate_ast_isl (scop
))
341 graphite_finalize (need_cfg_cleanup_p
);
346 #else /* If ISL is not available: #ifndef HAVE_isl. */
349 graphite_transform_loops (void)
351 sorry ("Graphite loop optimizations cannot be used (ISL is not available).");
358 graphite_transforms (struct function
*fun
)
360 if (number_of_loops (fun
) <= 1)
363 graphite_transform_loops ();
369 gate_graphite_transforms (void)
371 /* Enable -fgraphite pass if any one of the graphite optimization flags
373 if (flag_graphite_identity
374 || flag_loop_parallelize_all
375 || flag_loop_nest_optimize
)
378 return flag_graphite
!= 0;
383 const pass_data pass_data_graphite
=
385 GIMPLE_PASS
, /* type */
386 "graphite0", /* name */
387 OPTGROUP_LOOP
, /* optinfo_flags */
388 TV_GRAPHITE
, /* tv_id */
389 ( PROP_cfg
| PROP_ssa
), /* properties_required */
390 0, /* properties_provided */
391 0, /* properties_destroyed */
392 0, /* todo_flags_start */
393 0, /* todo_flags_finish */
396 class pass_graphite
: public gimple_opt_pass
399 pass_graphite (gcc::context
*ctxt
)
400 : gimple_opt_pass (pass_data_graphite
, ctxt
)
403 /* opt_pass methods: */
404 virtual bool gate (function
*) { return gate_graphite_transforms (); }
406 }; // class pass_graphite
411 make_pass_graphite (gcc::context
*ctxt
)
413 return new pass_graphite (ctxt
);
418 const pass_data pass_data_graphite_transforms
=
420 GIMPLE_PASS
, /* type */
421 "graphite", /* name */
422 OPTGROUP_LOOP
, /* optinfo_flags */
423 TV_GRAPHITE_TRANSFORMS
, /* tv_id */
424 ( PROP_cfg
| PROP_ssa
), /* properties_required */
425 0, /* properties_provided */
426 0, /* properties_destroyed */
427 0, /* todo_flags_start */
428 0, /* todo_flags_finish */
431 class pass_graphite_transforms
: public gimple_opt_pass
434 pass_graphite_transforms (gcc::context
*ctxt
)
435 : gimple_opt_pass (pass_data_graphite_transforms
, ctxt
)
438 /* opt_pass methods: */
439 virtual bool gate (function
*) { return gate_graphite_transforms (); }
440 virtual unsigned int execute (function
*fun
) { return graphite_transforms (fun
); }
442 }; // class pass_graphite_transforms
447 make_pass_graphite_transforms (gcc::context
*ctxt
)
449 return new pass_graphite_transforms (ctxt
);