diff options
author | Ben Cheng <bccheng@google.com> | 2013-03-28 11:14:20 -0700 |
---|---|---|
committer | Ben Cheng <bccheng@google.com> | 2013-03-28 12:40:33 -0700 |
commit | af0c51ac87ab2a87caa03fa108f0d164987a2764 (patch) | |
tree | 4b8b470f7c5b69642fdab8d0aa1fbc148d02196b /gcc-4.8/gcc/graphite.c | |
parent | d87cae247d39ebf4f5a6bf25c932a14d2fdb9384 (diff) | |
download | toolchain_gcc-af0c51ac87ab2a87caa03fa108f0d164987a2764.tar.gz toolchain_gcc-af0c51ac87ab2a87caa03fa108f0d164987a2764.tar.bz2 toolchain_gcc-af0c51ac87ab2a87caa03fa108f0d164987a2764.zip |
[GCC 4.8] Initial check-in of GCC 4.8.0
Change-Id: I0719d8a6d0f69b367a6ab6f10eb75622dbf12771
Diffstat (limited to 'gcc-4.8/gcc/graphite.c')
-rw-r--r-- | gcc-4.8/gcc/graphite.c | 309 |
1 files changed, 309 insertions, 0 deletions
diff --git a/gcc-4.8/gcc/graphite.c b/gcc-4.8/gcc/graphite.c new file mode 100644 index 000000000..7511527de --- /dev/null +++ b/gcc-4.8/gcc/graphite.c @@ -0,0 +1,309 @@ +/* Gimple Represented as Polyhedra. + Copyright (C) 2006-2013 Free Software Foundation, Inc. + Contributed by Sebastian Pop <sebastian.pop@inria.fr>. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify +it under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. + +GCC is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +<http://www.gnu.org/licenses/>. */ + +/* This pass converts GIMPLE to GRAPHITE, performs some loop + transformations and then converts the resulting representation back + to GIMPLE. + + An early description of this pass can be found in the GCC Summit'06 + paper "GRAPHITE: Polyhedral Analyses and Optimizations for GCC". + The wiki page http://gcc.gnu.org/wiki/Graphite contains pointers to + the related work. + + One important document to read is CLooG's internal manual: + http://repo.or.cz/w/cloog-ppl.git?a=blob_plain;f=doc/cloog.texi;hb=HEAD + that describes the data structure of loops used in this file, and + the functions that are used for transforming the code. */ + +#include "config.h" + +#ifdef HAVE_cloog +#include <isl/set.h> +#include <isl/map.h> +#include <isl/options.h> +#include <isl/union_map.h> +#include <cloog/cloog.h> +#include <cloog/isl/domain.h> +#include <cloog/isl/cloog.h> +#endif + +#include "system.h" +#include "coretypes.h" +#include "diagnostic-core.h" +#include "tree-flow.h" +#include "tree-dump.h" +#include "cfgloop.h" +#include "tree-chrec.h" +#include "tree-data-ref.h" +#include "tree-scalar-evolution.h" +#include "sese.h" +#include "dbgcnt.h" + +#ifdef HAVE_cloog + +#include "graphite-poly.h" +#include "graphite-scop-detection.h" +#include "graphite-clast-to-gimple.h" +#include "graphite-sese-to-poly.h" + +CloogState *cloog_state; + +/* Print global statistics to FILE. */ + +static void +print_global_statistics (FILE* file) +{ + long n_bbs = 0; + long n_loops = 0; + long n_stmts = 0; + long n_conditions = 0; + long n_p_bbs = 0; + long n_p_loops = 0; + long n_p_stmts = 0; + long n_p_conditions = 0; + + basic_block bb; + + FOR_ALL_BB (bb) + { + gimple_stmt_iterator psi; + + n_bbs++; + n_p_bbs += bb->count; + + /* Ignore artificial surrounding loop. */ + if (bb == bb->loop_father->header + && bb->index != 0) + { + n_loops++; + n_p_loops += bb->count; + } + + if (EDGE_COUNT (bb->succs) > 1) + { + n_conditions++; + n_p_conditions += bb->count; + } + + for (psi = gsi_start_bb (bb); !gsi_end_p (psi); gsi_next (&psi)) + { + n_stmts++; + n_p_stmts += bb->count; + } + } + + fprintf (file, "\nGlobal statistics ("); + fprintf (file, "BBS:%ld, ", n_bbs); + fprintf (file, "LOOPS:%ld, ", n_loops); + fprintf (file, "CONDITIONS:%ld, ", n_conditions); + fprintf (file, "STMTS:%ld)\n", n_stmts); + fprintf (file, "\nGlobal profiling statistics ("); + fprintf (file, "BBS:%ld, ", n_p_bbs); + fprintf (file, "LOOPS:%ld, ", n_p_loops); + fprintf (file, "CONDITIONS:%ld, ", n_p_conditions); + fprintf (file, "STMTS:%ld)\n", n_p_stmts); +} + +/* Print statistics for SCOP to FILE. */ + +static void +print_graphite_scop_statistics (FILE* file, scop_p scop) +{ + long n_bbs = 0; + long n_loops = 0; + long n_stmts = 0; + long n_conditions = 0; + long n_p_bbs = 0; + long n_p_loops = 0; + long n_p_stmts = 0; + long n_p_conditions = 0; + + basic_block bb; + + FOR_ALL_BB (bb) + { + gimple_stmt_iterator psi; + loop_p loop = bb->loop_father; + + if (!bb_in_sese_p (bb, SCOP_REGION (scop))) + continue; + + n_bbs++; + n_p_bbs += bb->count; + + if (EDGE_COUNT (bb->succs) > 1) + { + n_conditions++; + n_p_conditions += bb->count; + } + + for (psi = gsi_start_bb (bb); !gsi_end_p (psi); gsi_next (&psi)) + { + n_stmts++; + n_p_stmts += bb->count; + } + + if (loop->header == bb && loop_in_sese_p (loop, SCOP_REGION (scop))) + { + n_loops++; + n_p_loops += bb->count; + } + } + + fprintf (file, "\nSCoP statistics ("); + fprintf (file, "BBS:%ld, ", n_bbs); + fprintf (file, "LOOPS:%ld, ", n_loops); + fprintf (file, "CONDITIONS:%ld, ", n_conditions); + fprintf (file, "STMTS:%ld)\n", n_stmts); + fprintf (file, "\nSCoP profiling statistics ("); + fprintf (file, "BBS:%ld, ", n_p_bbs); + fprintf (file, "LOOPS:%ld, ", n_p_loops); + fprintf (file, "CONDITIONS:%ld, ", n_p_conditions); + fprintf (file, "STMTS:%ld)\n", n_p_stmts); +} + +/* Print statistics for SCOPS to FILE. */ + +static void +print_graphite_statistics (FILE* file, vec<scop_p> scops) +{ + int i; + + scop_p scop; + + FOR_EACH_VEC_ELT (scops, i, scop) + print_graphite_scop_statistics (file, scop); +} + +/* Initialize graphite: when there are no loops returns false. */ + +static bool +graphite_initialize (isl_ctx *ctx) +{ + if (number_of_loops () <= 1 + /* FIXME: This limit on the number of basic blocks of a function + should be removed when the SCOP detection is faster. */ + || n_basic_blocks > PARAM_VALUE (PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION)) + { + if (dump_file && (dump_flags & TDF_DETAILS)) + print_global_statistics (dump_file); + + isl_ctx_free (ctx); + return false; + } + + scev_reset (); + recompute_all_dominators (); + initialize_original_copy_tables (); + + cloog_state = cloog_isl_state_malloc (ctx); + + if (dump_file && dump_flags) + dump_function_to_file (current_function_decl, dump_file, dump_flags); + + return true; +} + +/* Finalize graphite: perform CFG cleanup when NEED_CFG_CLEANUP_P is + true. */ + +static void +graphite_finalize (bool need_cfg_cleanup_p) +{ + if (need_cfg_cleanup_p) + { + scev_reset (); + cleanup_tree_cfg (); + profile_status = PROFILE_ABSENT; + release_recorded_exits (); + tree_estimate_probability (); + } + + cloog_state_free (cloog_state); + free_original_copy_tables (); + + if (dump_file && dump_flags) + print_loops (dump_file, 3); +} + +isl_ctx *the_isl_ctx; + +/* Perform a set of linear transforms on the loops of the current + function. */ + +void +graphite_transform_loops (void) +{ + int i; + scop_p scop; + bool need_cfg_cleanup_p = false; + vec<scop_p> scops = vNULL; + htab_t bb_pbb_mapping; + isl_ctx *ctx; + + /* If a function is parallel it was most probably already run through graphite + once. No need to run again. */ + if (parallelized_function_p (cfun->decl)) + return; + + ctx = isl_ctx_alloc (); + isl_options_set_on_error(ctx, ISL_ON_ERROR_ABORT); + if (!graphite_initialize (ctx)) + return; + + the_isl_ctx = ctx; + build_scops (&scops); + + if (dump_file && (dump_flags & TDF_DETAILS)) + { + print_graphite_statistics (dump_file, scops); + print_global_statistics (dump_file); + } + + bb_pbb_mapping = htab_create (10, bb_pbb_map_hash, eq_bb_pbb_map, free); + + FOR_EACH_VEC_ELT (scops, i, scop) + if (dbg_cnt (graphite_scop)) + { + scop->ctx = ctx; + build_poly_scop (scop); + + if (POLY_SCOP_P (scop) + && apply_poly_transforms (scop) + && gloog (scop, bb_pbb_mapping)) + need_cfg_cleanup_p = true; + } + + htab_delete (bb_pbb_mapping); + free_scops (scops); + graphite_finalize (need_cfg_cleanup_p); + the_isl_ctx = NULL; + isl_ctx_free (ctx); +} + +#else /* If Cloog is not available: #ifndef HAVE_cloog. */ + +void +graphite_transform_loops (void) +{ + sorry ("Graphite loop optimizations cannot be used"); +} + +#endif |