[ARM 2/5 big.LITTLE] Allow tuning parameters without unique tuning targets.
[official-gcc.git] / gcc / graphite.c
blob8af040257db01d4bb1fb9c0ce7b437e351ddaeb2
1 /* Gimple Represented as Polyhedra.
2 Copyright (C) 2006-2013 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)
10 any later version.
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
23 to GIMPLE.
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
28 the related work.
30 One important document to read is CLooG's internal manual:
31 http://repo.or.cz/w/cloog-ppl.git?a=blob_plain;f=doc/cloog.texi;hb=HEAD
32 that describes the data structure of loops used in this file, and
33 the functions that are used for transforming the code. */
35 #include "config.h"
37 #ifdef HAVE_cloog
38 #include <isl/set.h>
39 #include <isl/map.h>
40 #include <isl/options.h>
41 #include <isl/union_map.h>
42 #include <cloog/cloog.h>
43 #include <cloog/isl/domain.h>
44 #include <cloog/isl/cloog.h>
45 #endif
47 #include "system.h"
48 #include "coretypes.h"
49 #include "diagnostic-core.h"
50 #include "tree.h"
51 #include "basic-block.h"
52 #include "tree-ssa-alias.h"
53 #include "internal-fn.h"
54 #include "gimple-expr.h"
55 #include "is-a.h"
56 #include "gimple.h"
57 #include "gimple-iterator.h"
58 #include "tree-cfg.h"
59 #include "tree-ssa-loop.h"
60 #include "tree-dump.h"
61 #include "cfgloop.h"
62 #include "tree-chrec.h"
63 #include "tree-data-ref.h"
64 #include "tree-scalar-evolution.h"
65 #include "sese.h"
66 #include "dbgcnt.h"
67 #include "tree-parloops.h"
68 #include "tree-pass.h"
69 #include "tree-cfgcleanup.h"
71 #ifdef HAVE_cloog
73 #include "graphite-poly.h"
74 #include "graphite-scop-detection.h"
75 #include "graphite-clast-to-gimple.h"
76 #include "graphite-sese-to-poly.h"
77 #include "graphite-htab.h"
79 CloogState *cloog_state;
81 /* Print global statistics to FILE. */
83 static void
84 print_global_statistics (FILE* file)
86 long n_bbs = 0;
87 long n_loops = 0;
88 long n_stmts = 0;
89 long n_conditions = 0;
90 long n_p_bbs = 0;
91 long n_p_loops = 0;
92 long n_p_stmts = 0;
93 long n_p_conditions = 0;
95 basic_block bb;
97 FOR_ALL_BB_FN (bb, cfun)
99 gimple_stmt_iterator psi;
101 n_bbs++;
102 n_p_bbs += bb->count;
104 /* Ignore artificial surrounding loop. */
105 if (bb == bb->loop_father->header
106 && bb->index != 0)
108 n_loops++;
109 n_p_loops += bb->count;
112 if (EDGE_COUNT (bb->succs) > 1)
114 n_conditions++;
115 n_p_conditions += bb->count;
118 for (psi = gsi_start_bb (bb); !gsi_end_p (psi); gsi_next (&psi))
120 n_stmts++;
121 n_p_stmts += bb->count;
125 fprintf (file, "\nGlobal statistics (");
126 fprintf (file, "BBS:%ld, ", n_bbs);
127 fprintf (file, "LOOPS:%ld, ", n_loops);
128 fprintf (file, "CONDITIONS:%ld, ", n_conditions);
129 fprintf (file, "STMTS:%ld)\n", n_stmts);
130 fprintf (file, "\nGlobal profiling statistics (");
131 fprintf (file, "BBS:%ld, ", n_p_bbs);
132 fprintf (file, "LOOPS:%ld, ", n_p_loops);
133 fprintf (file, "CONDITIONS:%ld, ", n_p_conditions);
134 fprintf (file, "STMTS:%ld)\n", n_p_stmts);
137 /* Print statistics for SCOP to FILE. */
139 static void
140 print_graphite_scop_statistics (FILE* file, scop_p scop)
142 long n_bbs = 0;
143 long n_loops = 0;
144 long n_stmts = 0;
145 long n_conditions = 0;
146 long n_p_bbs = 0;
147 long n_p_loops = 0;
148 long n_p_stmts = 0;
149 long n_p_conditions = 0;
151 basic_block bb;
153 FOR_ALL_BB_FN (bb, cfun)
155 gimple_stmt_iterator psi;
156 loop_p loop = bb->loop_father;
158 if (!bb_in_sese_p (bb, SCOP_REGION (scop)))
159 continue;
161 n_bbs++;
162 n_p_bbs += bb->count;
164 if (EDGE_COUNT (bb->succs) > 1)
166 n_conditions++;
167 n_p_conditions += bb->count;
170 for (psi = gsi_start_bb (bb); !gsi_end_p (psi); gsi_next (&psi))
172 n_stmts++;
173 n_p_stmts += bb->count;
176 if (loop->header == bb && loop_in_sese_p (loop, SCOP_REGION (scop)))
178 n_loops++;
179 n_p_loops += bb->count;
183 fprintf (file, "\nSCoP statistics (");
184 fprintf (file, "BBS:%ld, ", n_bbs);
185 fprintf (file, "LOOPS:%ld, ", n_loops);
186 fprintf (file, "CONDITIONS:%ld, ", n_conditions);
187 fprintf (file, "STMTS:%ld)\n", n_stmts);
188 fprintf (file, "\nSCoP profiling statistics (");
189 fprintf (file, "BBS:%ld, ", n_p_bbs);
190 fprintf (file, "LOOPS:%ld, ", n_p_loops);
191 fprintf (file, "CONDITIONS:%ld, ", n_p_conditions);
192 fprintf (file, "STMTS:%ld)\n", n_p_stmts);
195 /* Print statistics for SCOPS to FILE. */
197 static void
198 print_graphite_statistics (FILE* file, vec<scop_p> scops)
200 int i;
202 scop_p scop;
204 FOR_EACH_VEC_ELT (scops, i, scop)
205 print_graphite_scop_statistics (file, scop);
208 /* Initialize graphite: when there are no loops returns false. */
210 static bool
211 graphite_initialize (isl_ctx *ctx)
213 if (number_of_loops (cfun) <= 1
214 /* FIXME: This limit on the number of basic blocks of a function
215 should be removed when the SCOP detection is faster. */
216 || (n_basic_blocks_for_fn (cfun) >
217 PARAM_VALUE (PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION)))
219 if (dump_file && (dump_flags & TDF_DETAILS))
220 print_global_statistics (dump_file);
222 isl_ctx_free (ctx);
223 return false;
226 scev_reset ();
227 recompute_all_dominators ();
228 initialize_original_copy_tables ();
230 cloog_state = cloog_isl_state_malloc (ctx);
232 if (dump_file && dump_flags)
233 dump_function_to_file (current_function_decl, dump_file, dump_flags);
235 return true;
238 /* Finalize graphite: perform CFG cleanup when NEED_CFG_CLEANUP_P is
239 true. */
241 static void
242 graphite_finalize (bool need_cfg_cleanup_p)
244 if (need_cfg_cleanup_p)
246 scev_reset ();
247 cleanup_tree_cfg ();
248 profile_status_for_fn (cfun) = PROFILE_ABSENT;
249 release_recorded_exits ();
250 tree_estimate_probability ();
253 cloog_state_free (cloog_state);
254 free_original_copy_tables ();
256 if (dump_file && dump_flags)
257 print_loops (dump_file, 3);
260 isl_ctx *the_isl_ctx;
262 /* Perform a set of linear transforms on the loops of the current
263 function. */
265 void
266 graphite_transform_loops (void)
268 int i;
269 scop_p scop;
270 bool need_cfg_cleanup_p = false;
271 vec<scop_p> scops = vNULL;
272 bb_pbb_htab_type bb_pbb_mapping;
273 isl_ctx *ctx;
275 /* If a function is parallel it was most probably already run through graphite
276 once. No need to run again. */
277 if (parallelized_function_p (cfun->decl))
278 return;
280 ctx = isl_ctx_alloc ();
281 isl_options_set_on_error (ctx, ISL_ON_ERROR_ABORT);
282 if (!graphite_initialize (ctx))
283 return;
285 the_isl_ctx = ctx;
286 build_scops (&scops);
288 if (dump_file && (dump_flags & TDF_DETAILS))
290 print_graphite_statistics (dump_file, scops);
291 print_global_statistics (dump_file);
294 bb_pbb_mapping.create (10);
296 FOR_EACH_VEC_ELT (scops, i, scop)
297 if (dbg_cnt (graphite_scop))
299 scop->ctx = ctx;
300 build_poly_scop (scop);
302 if (POLY_SCOP_P (scop)
303 && apply_poly_transforms (scop)
304 && gloog (scop, bb_pbb_mapping))
305 need_cfg_cleanup_p = true;
308 bb_pbb_mapping.dispose ();
309 free_scops (scops);
310 graphite_finalize (need_cfg_cleanup_p);
311 the_isl_ctx = NULL;
312 isl_ctx_free (ctx);
315 #else /* If Cloog is not available: #ifndef HAVE_cloog. */
317 static void
318 graphite_transform_loops (void)
320 sorry ("Graphite loop optimizations cannot be used");
323 #endif
326 static unsigned int
327 graphite_transforms (void)
329 if (!current_loops)
330 return 0;
332 graphite_transform_loops ();
334 return 0;
337 static bool
338 gate_graphite_transforms (void)
340 /* Enable -fgraphite pass if any one of the graphite optimization flags
341 is turned on. */
342 if (flag_loop_block
343 || flag_loop_interchange
344 || flag_loop_strip_mine
345 || flag_graphite_identity
346 || flag_loop_parallelize_all
347 || flag_loop_optimize_isl)
348 flag_graphite = 1;
350 return flag_graphite != 0;
353 namespace {
355 const pass_data pass_data_graphite =
357 GIMPLE_PASS, /* type */
358 "graphite0", /* name */
359 OPTGROUP_LOOP, /* optinfo_flags */
360 true, /* has_gate */
361 false, /* has_execute */
362 TV_GRAPHITE, /* tv_id */
363 ( PROP_cfg | PROP_ssa ), /* properties_required */
364 0, /* properties_provided */
365 0, /* properties_destroyed */
366 0, /* todo_flags_start */
367 0, /* todo_flags_finish */
370 class pass_graphite : public gimple_opt_pass
372 public:
373 pass_graphite (gcc::context *ctxt)
374 : gimple_opt_pass (pass_data_graphite, ctxt)
377 /* opt_pass methods: */
378 bool gate () { return gate_graphite_transforms (); }
380 }; // class pass_graphite
382 } // anon namespace
384 gimple_opt_pass *
385 make_pass_graphite (gcc::context *ctxt)
387 return new pass_graphite (ctxt);
390 namespace {
392 const pass_data pass_data_graphite_transforms =
394 GIMPLE_PASS, /* type */
395 "graphite", /* name */
396 OPTGROUP_LOOP, /* optinfo_flags */
397 true, /* has_gate */
398 true, /* has_execute */
399 TV_GRAPHITE_TRANSFORMS, /* tv_id */
400 ( PROP_cfg | PROP_ssa ), /* properties_required */
401 0, /* properties_provided */
402 0, /* properties_destroyed */
403 0, /* todo_flags_start */
404 0, /* todo_flags_finish */
407 class pass_graphite_transforms : public gimple_opt_pass
409 public:
410 pass_graphite_transforms (gcc::context *ctxt)
411 : gimple_opt_pass (pass_data_graphite_transforms, ctxt)
414 /* opt_pass methods: */
415 bool gate () { return gate_graphite_transforms (); }
416 unsigned int execute () { return graphite_transforms (); }
418 }; // class pass_graphite_transforms
420 } // anon namespace
422 gimple_opt_pass *
423 make_pass_graphite_transforms (gcc::context *ctxt)
425 return new pass_graphite_transforms (ctxt);