diff options
Diffstat (limited to 'gcc/tree-predcom.c')
| -rw-r--r-- | gcc/tree-predcom.c | 64 |
1 files changed, 32 insertions, 32 deletions
diff --git a/gcc/tree-predcom.c b/gcc/tree-predcom.c index dfb2146..299c45e 100644 --- a/gcc/tree-predcom.c +++ b/gcc/tree-predcom.c @@ -735,7 +735,7 @@ determine_offset (struct data_reference *a, struct data_reference *b, it is executed whenever the loop is entered. */ static basic_block -last_always_executed_block (struct loop *loop) +last_always_executed_block (class loop *loop) { unsigned i; vec<edge> exits = get_loop_exit_edges (loop); @@ -752,7 +752,7 @@ last_always_executed_block (struct loop *loop) /* Splits dependence graph on DATAREFS described by DEPENDS to components. */ static struct component * -split_data_refs_to_components (struct loop *loop, +split_data_refs_to_components (class loop *loop, vec<data_reference_p> datarefs, vec<ddr_p> depends) { @@ -896,7 +896,7 @@ split_data_refs_to_components (struct loop *loop, comps[ca] = comp; } - dataref = XCNEW (struct dref_d); + dataref = XCNEW (class dref_d); dataref->ref = dr; dataref->stmt = DR_STMT (dr); dataref->offset = 0; @@ -931,7 +931,7 @@ end: loop. */ static bool -suitable_component_p (struct loop *loop, struct component *comp) +suitable_component_p (class loop *loop, struct component *comp) { unsigned i; dref a, first; @@ -987,7 +987,7 @@ suitable_component_p (struct loop *loop, struct component *comp) the beginning of this file. LOOP is the current loop. */ static struct component * -filter_suitable_components (struct loop *loop, struct component *comps) +filter_suitable_components (class loop *loop, struct component *comps) { struct component **comp, *act; @@ -1232,7 +1232,7 @@ valid_initializer_p (struct data_reference *ref, is the root of the current chain. */ static gphi * -find_looparound_phi (struct loop *loop, dref ref, dref root) +find_looparound_phi (class loop *loop, dref ref, dref root) { tree name, init, init_ref; gphi *phi = NULL; @@ -1296,7 +1296,7 @@ find_looparound_phi (struct loop *loop, dref ref, dref root) static void insert_looparound_copy (chain_p chain, dref ref, gphi *phi) { - dref nw = XCNEW (struct dref_d), aref; + dref nw = XCNEW (class dref_d), aref; unsigned i; nw->stmt = phi; @@ -1321,7 +1321,7 @@ insert_looparound_copy (chain_p chain, dref ref, gphi *phi) (also, it may allow us to combine chains together). */ static void -add_looparound_copies (struct loop *loop, chain_p chain) +add_looparound_copies (class loop *loop, chain_p chain) { unsigned i; dref ref, root = get_chain_root (chain); @@ -1346,7 +1346,7 @@ add_looparound_copies (struct loop *loop, chain_p chain) loop. */ static void -determine_roots_comp (struct loop *loop, +determine_roots_comp (class loop *loop, struct component *comp, vec<chain_p> *chains) { @@ -1436,7 +1436,7 @@ determine_roots_comp (struct loop *loop, separates the references to CHAINS. LOOP is the current loop. */ static void -determine_roots (struct loop *loop, +determine_roots (class loop *loop, struct component *comps, vec<chain_p> *chains) { struct component *comp; @@ -1653,7 +1653,7 @@ predcom_tmp_var (tree ref, unsigned i, bitmap tmp_vars) temporary variables are marked in TMP_VARS. */ static void -initialize_root_vars (struct loop *loop, chain_p chain, bitmap tmp_vars) +initialize_root_vars (class loop *loop, chain_p chain, bitmap tmp_vars) { unsigned i; unsigned n = chain->length; @@ -1707,7 +1707,7 @@ initialize_root_vars (struct loop *loop, chain_p chain, bitmap tmp_vars) In this case, we can use these invariant values directly after LOOP. */ static bool -is_inv_store_elimination_chain (struct loop *loop, chain_p chain) +is_inv_store_elimination_chain (class loop *loop, chain_p chain) { if (chain->length == 0 || chain->type != CT_STORE_STORE) return false; @@ -1801,7 +1801,7 @@ initialize_root_vars_store_elim_1 (chain_p chain) of the newly created root variables are marked in TMP_VARS. */ static void -initialize_root_vars_store_elim_2 (struct loop *loop, +initialize_root_vars_store_elim_2 (class loop *loop, chain_p chain, bitmap tmp_vars) { unsigned i, n = chain->length; @@ -1886,7 +1886,7 @@ initialize_root_vars_store_elim_2 (struct loop *loop, (CHAIN->length - 1) iterations. */ static void -finalize_eliminated_stores (struct loop *loop, chain_p chain) +finalize_eliminated_stores (class loop *loop, chain_p chain) { unsigned i, n = chain->length; @@ -1914,7 +1914,7 @@ finalize_eliminated_stores (struct loop *loop, chain_p chain) initializer. */ static void -initialize_root_vars_lm (struct loop *loop, dref root, bool written, +initialize_root_vars_lm (class loop *loop, dref root, bool written, vec<tree> *vars, vec<tree> inits, bitmap tmp_vars) { @@ -1962,7 +1962,7 @@ initialize_root_vars_lm (struct loop *loop, dref root, bool written, created temporary variables are marked in TMP_VARS. */ static void -execute_load_motion (struct loop *loop, chain_p chain, bitmap tmp_vars) +execute_load_motion (class loop *loop, chain_p chain, bitmap tmp_vars) { auto_vec<tree> vars; dref a; @@ -2103,7 +2103,7 @@ remove_stmt (gimple *stmt) Uids of the newly created temporary variables are marked in TMP_VARS.*/ static void -execute_pred_commoning_chain (struct loop *loop, chain_p chain, +execute_pred_commoning_chain (class loop *loop, chain_p chain, bitmap tmp_vars) { unsigned i; @@ -2234,7 +2234,7 @@ determine_unroll_factor (vec<chain_p> chains) Uids of the newly created temporary variables are marked in TMP_VARS. */ static void -execute_pred_commoning (struct loop *loop, vec<chain_p> chains, +execute_pred_commoning (class loop *loop, vec<chain_p> chains, bitmap tmp_vars) { chain_p chain; @@ -2317,7 +2317,7 @@ struct epcc_data }; static void -execute_pred_commoning_cbck (struct loop *loop, void *data) +execute_pred_commoning_cbck (class loop *loop, void *data) { struct epcc_data *const dta = (struct epcc_data *) data; @@ -2333,7 +2333,7 @@ execute_pred_commoning_cbck (struct loop *loop, void *data) the header of the LOOP. */ static void -base_names_in_chain_on (struct loop *loop, tree name, tree var) +base_names_in_chain_on (class loop *loop, tree name, tree var) { gimple *stmt, *phi; imm_use_iterator iter; @@ -2366,7 +2366,7 @@ base_names_in_chain_on (struct loop *loop, tree name, tree var) for those we want to perform this. */ static void -eliminate_temp_copies (struct loop *loop, bitmap tmp_vars) +eliminate_temp_copies (class loop *loop, bitmap tmp_vars) { edge e; gphi *phi; @@ -2751,7 +2751,7 @@ combine_chains (chain_p ch1, chain_p ch2) for (i = 0; (ch1->refs.iterate (i, &r1) && ch2->refs.iterate (i, &r2)); i++) { - nw = XCNEW (struct dref_d); + nw = XCNEW (class dref_d); nw->stmt = stmt_combining_refs (r1, r2); nw->distance = r1->distance; @@ -2801,7 +2801,7 @@ pcom_stmt_dominates_stmt_p (gimple *s1, gimple *s2) /* Try to combine the CHAINS in LOOP. */ static void -try_combine_chains (struct loop *loop, vec<chain_p> *chains) +try_combine_chains (class loop *loop, vec<chain_p> *chains) { unsigned i, j; chain_p ch1, ch2, cch; @@ -2911,7 +2911,7 @@ try_combine_chains (struct loop *loop, vec<chain_p> *chains) otherwise. */ static bool -prepare_initializers_chain_store_elim (struct loop *loop, chain_p chain) +prepare_initializers_chain_store_elim (class loop *loop, chain_p chain) { unsigned i, n = chain->length; @@ -2978,7 +2978,7 @@ prepare_initializers_chain_store_elim (struct loop *loop, chain_p chain) impossible because one of these initializers may trap, true otherwise. */ static bool -prepare_initializers_chain (struct loop *loop, chain_p chain) +prepare_initializers_chain (class loop *loop, chain_p chain) { unsigned i, n = (chain->type == CT_INVARIANT) ? 1 : chain->length; struct data_reference *dr = get_chain_root (chain)->ref; @@ -3034,7 +3034,7 @@ prepare_initializers_chain (struct loop *loop, chain_p chain) be used because the initializers might trap. */ static void -prepare_initializers (struct loop *loop, vec<chain_p> chains) +prepare_initializers (class loop *loop, vec<chain_p> chains) { chain_p chain; unsigned i; @@ -3056,7 +3056,7 @@ prepare_initializers (struct loop *loop, vec<chain_p> chains) if finalizer code for CHAIN can be generated, otherwise false. */ static bool -prepare_finalizers_chain (struct loop *loop, chain_p chain) +prepare_finalizers_chain (class loop *loop, chain_p chain) { unsigned i, n = chain->length; struct data_reference *dr = get_chain_root (chain)->ref; @@ -3104,7 +3104,7 @@ prepare_finalizers_chain (struct loop *loop, chain_p chain) if finalizer code generation for CHAINS breaks loop closed ssa form. */ static bool -prepare_finalizers (struct loop *loop, vec<chain_p> chains) +prepare_finalizers (class loop *loop, vec<chain_p> chains) { chain_p chain; unsigned i; @@ -3143,7 +3143,7 @@ prepare_finalizers (struct loop *loop, vec<chain_p> chains) /* Insert all initializing gimple stmts into loop's entry edge. */ static void -insert_init_seqs (struct loop *loop, vec<chain_p> chains) +insert_init_seqs (class loop *loop, vec<chain_p> chains) { unsigned i; edge entry = loop_preheader_edge (loop); @@ -3161,14 +3161,14 @@ insert_init_seqs (struct loop *loop, vec<chain_p> chains) form was corrupted. */ static unsigned -tree_predictive_commoning_loop (struct loop *loop) +tree_predictive_commoning_loop (class loop *loop) { vec<data_reference_p> datarefs; vec<ddr_p> dependences; struct component *components; vec<chain_p> chains = vNULL; unsigned unroll_factor; - struct tree_niter_desc desc; + class tree_niter_desc desc; bool unroll = false, loop_closed_ssa = false; edge exit; @@ -3304,7 +3304,7 @@ end: ; unsigned tree_predictive_commoning (void) { - struct loop *loop; + class loop *loop; unsigned ret = 0, changed = 0; initialize_original_copy_tables (); |