1e128c5f7b
* targhooks.c (default_unwind_emit, default_scalar_mode_supported_p): Use gcc_assert, gcc_unreachable & internal_error instead of abort. * timevar.c (timevar_push, timevar_pop, timevar_start, timevar_stop): Likewise. * toplev.c (default_pch_valid_p): Likewise. * tracer.c (tail_duplicate): Likewise. * tree-alias-common.c (get_alias_var_decl, get_values_from_constructor, create_alias_var, delete_alias_vars, empty_points_to_set, same_points_to_set, ptr_may_alias_var): Likewise. * tree.c (tree_size, make_node_stat, copy_node_stat, build_int_cst_wide, integer_all_onesp, list_length, chainon, tree_node_structure, type_contains_placeholder_p, substitute_in_expr, substitute_placeholder_in_expr, tabilize_reference_1, build0_stat, build1_stat, build2_stat, build3_stat, build4_stat, is_attribute_p, lookup_attribute, type_hash_canon, host_integerp, iterative_hash_expr, build_method_type_directly, decl_type_context, get_callee_fndecl, get_set_constructor_bits, build_vector_type_for_mode, int_cst_value, tree_fold_gcd): Likewise. * tree-cfg.c (create_bb, make_ctrl_stmt_edges, make_exit_edges, make_cond_expr_edges, group_case_labels, tree_merge_blocks, cleanup_control_expr_graph, find_taken_edge, find_taken_edge_switch_expr, phi_alternatives_equal, is_ctrl_altering_stmt, disband_implicit_edges, set_bb_for_stmt, stmt_for_bsi, tree_find_edge_insert_loc, bsi_insert_on_edge_immediate, tree_split_edge, tree_verify_flow_info, thread_jumps, tree_redirect_edge_and_branch, tree_flow_call_edges_add): Likewise. * tree-chrec.c (chrec_fold_poly_cst, chrec_fold_plus_poly_poly, chrec_fold_multiply_poly_poly): Likewise. * tree-complex.c (extract_component, expand_complex_division, expand_complex_comparison, expand_complex_operations_1, build_replicated_const, expand_vector_operations_1): Likewise. * tree-data-ref.c (tree_fold_bezout, build_classic_dist_vector, build_classic_dir_vector): Likewise. * tree-dfa.c (compute_immediate_uses_for_phi, compute_immediate_uses_for_stmt, create_var_ann, create_stmt_ann, create_tree_ann, collect_dfa_stats, get_virtual_var): Likewise. * tree-dump.c (dequeue_and_dump): Likewise. * tree-eh.c (record_stmt_eh_region, add_stmt_to_eh_region, record_in_finally_tree, replace_goto_queue_1, maybe_record_in_goto_queue, verify_norecord_switch_expr, do_return_redirection): Likewise. * tree-if-conv.c (tree_if_convert_stmt, tree_if_convert_cond_expr, add_to_dst_predicate_list, find_phi_replacement_condition, replace_phi_with_cond_modify_expr, get_loop_body_in_if_conv_order): Likewise. * tree-inline.c (remap_decl, remap_type, remap_decls, copy_body_r, initialize_inlined_parameters, declare_return_variable, estimate_num_insns_1, expand_call_inline, expand_calls_inline, optimize_inline_calls, copy_tree_r): Likewise. * tree-into-ssa.c (rewrite_initialize_block_local_data, rewrite_stmt, ssa_rewrite_stmt, rewrite_into_ssa): Likewise. * tree-iterator.c (alloc_stmt_list, tsi_link_before, tsi_link_after, tsi_split_statement_list_after, tsi_split_statement_list_before): Likewise. * tree-mudflap.c (mf_varname_tree): Likewise. * tree-nested.c (create_tmp_var_for, lookup_field_for_decl, lookup_tramp_for_decl, convert_all_function_calls): Likewise. * tree-optimize.c (tree_rest_of_compilation): Likewise. * tree-outof-ssa.c (create_temp, eliminate_build, eliminate_phi, coalesce_abnormal_edges, coalesce_ssa_name, eliminate_virtual_phis, free_temp_expr_table, add_dependance, finish_expr, rewrite_trees): Likewise. * tree-phinodes.c (resize_phi_node, add_phi_arg, remove_all_phi_nodes_for): Likewise. * tree-pretty-print.c (op_prio, print_call_name): Likewise. * tree-profile.c (tree_gen_interval_profiler, tree_gen_pow2_profiler, tree_gen_one_value_profiler, tree_gen_const_delta_profiler): Likewise. * tree-sra.c (type_can_instantiate_all_elements, sra_hash_tree, sra_elt_eq, sra_walk_expr, instantiate_missing_elements, generate_one_element_ref, generate_element_copy, generate_element_zero, scalarize_copy, scalarize_init, scalarize_ldst): Likewise. * tree-ssa-alias.c (delete_alias_info, group_aliases, may_alias_p, add_may_alias, add_pointed_to_expr, add_pointed_to_var, collect_points_to_info_r, get_tmt_for, get_ptr_info): Likewise. * tree-ssa.c (walk_use_def_chains, check_phi_redundancy): Likewise. * tree-ssa-ccp.c (dump_lattice_value, get_default_value, get_value, set_lattice_value, likely_value, ccp_visit_phi_node, visit_assignment, widen_bitfield, ccp_fold_builtin): Likewise. * tree-ssa-copy.c (may_propagate_copy, merge_alias_info, replace_exp_1, propagate_tree_value): Likewise. * tree-ssa-copyrename.c (copy_rename_partition_coalesce): Likewise. * tree-ssa-dce.c (set_control_dependence_map_bit, find_control_dependence, find_pdom, mark_operand_necessary, mark_stmt_if_obviously_necessary, mark_control_dependent_edges_necessary, remove_dead_stmt): Likewise. * tree-ssa-dom.c (dom_opt_initialize_block_local_data, simplify_switch_and_lookup_avail_expr, cprop_into_successor_phis, eliminate_redundant_computations, avail_expr_eq): Likewise. * tree-ssa-dse.c (fix_stmt_v_may_defs): Likewise. * tree-ssa-loop-ch.c (should_duplicate_loop_header_p, duplicate_blocks): Likewise. * tree-ssa-loop-im.c (for_each_index, set_level, is_call_clobbered_ref): Likewise. * tree-ssa-loop-ivopts.c (dump_use, divide, stmt_after_ip_normal_pos, stmt_after_increment, set_iv, contains_abnormal_ssa_name_p, find_interesting_uses_outer_or_nonlin, add_derived_ivs_candidates, peel_address, ptr_difference_cost, may_replace_final_value, determine_use_iv_cost, rewrite_use_nonlinear_expr, rewrite_use_outer, rewrite_use, rewrite_uses): Likewise. * tree-ssa-loop-manip.c (rewrite_into_loop_closed_ssa, check_loop_closed_ssa_use): Likewise. * tree-ssanames.c (make_ssa_name): Likewise. * tree-ssa-operands.c (finalize_ssa_defs, finalize_ssa_uses, finalize_ssa_v_must_defs, finalize_ssa_stmt_operands, get_stmt_operands, get_expr_operands, get_asm_expr_operands, get_indirect_ref_operands, add_stmt_operand): Likewise. * tree-ssa-pre.c (value_exists_in_set_bitmap, value_remove_from_set_bitmap, bitmap_insert_into_set, insert_into_set, phi_translate, valid_in_set, compute_antic, find_or_generate_expression, create_expression_by_pieces, insert_aux, create_value_expr_from, eliminate): Likewise. * tree-ssa-propagate.c (cfg_blocks_get): Likewise. * tree-ssa-threadupdate.c (remove_last_stmt_and_useless_edges): Likewise. * tree-tailcall.c (independent_of_stmt_p, adjust_return_value, eliminate_tail_call): Likewise. * tree-vectorizer.c (vect_create_index_for_array_ref, vect_align_data_ref, vect_create_data_ref, vect_create_destination_var, vect_get_vec_def_for_operand, vect_finish_stmt_generation, vect_transform_stmt, vect_transform_loop_bound, vect_transform_loop, vect_analyze_operations): Likewise. * tree-vn.c (vn_compute, set_value_handle, get_value_handle): Likewise. * tree-flow-inline.h (var_ann, get_var_ann, get_def_from_ptr, get_use_op_ptr, immediate_use, phi_ssa_name_p, bsi_start, bsi_after_labels, bsi_last): Likewise. * tree-ssa-live.c (var_union, change_partition_var, create_ssa_var_map, calculate_live_on_entry, root_var_init, type_var_init, add_coalesce, sort_coalesce_list, pop_best_coalesce): Likewise. * tree-ssa-live.h (partition_is_global, live_entry_blocks, tpa_find_tree): Likewise. (register_ssa_partition_check): Declare. (register_ssa_partition): use it. * tree-ssa-live.c: Include errors.h. (register_ssa_partition_check): New. * tree-ssa-operands.c: Include errors.h. * Makefile.in (tree-ssa-operands.o): Depend on errors.h. Co-Authored-By: Nathan Sidwell <nathan@codesourcery.com> From-SVN: r87223
276 lines
8.4 KiB
C
276 lines
8.4 KiB
C
/* Const/copy propagation and SSA_NAME replacement support routines.
|
|
Copyright (C) 2004 Free Software Foundation, Inc.
|
|
|
|
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 2, 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 COPYING. If not, write to
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#include "config.h"
|
|
#include "system.h"
|
|
#include "coretypes.h"
|
|
#include "tm.h"
|
|
#include "tree.h"
|
|
#include "flags.h"
|
|
#include "rtl.h"
|
|
#include "tm_p.h"
|
|
#include "ggc.h"
|
|
#include "basic-block.h"
|
|
#include "output.h"
|
|
#include "errors.h"
|
|
#include "expr.h"
|
|
#include "function.h"
|
|
#include "diagnostic.h"
|
|
#include "timevar.h"
|
|
#include "tree-dump.h"
|
|
#include "tree-flow.h"
|
|
#include "tree-pass.h"
|
|
#include "langhooks.h"
|
|
|
|
/* This file provides a handful of interfaces for performing const/copy
|
|
propagation and simple expression replacement which keep variable
|
|
annotations up-to-date.
|
|
|
|
We require that for any copy operation where the RHS and LHS have
|
|
a non-null memory tag that the memory tag be the same. It is OK
|
|
for one or both of the memory tags to be NULL.
|
|
|
|
We also require tracking if a variable is dereferenced in a load or
|
|
store operation.
|
|
|
|
We enforce these requirements by having all copy propagation and
|
|
replacements of one SSA_NAME with a different SSA_NAME to use the
|
|
APIs defined in this file. */
|
|
|
|
|
|
/* Return true if we may propagate ORIG into DEST, false otherwise. */
|
|
|
|
bool
|
|
may_propagate_copy (tree dest, tree orig)
|
|
{
|
|
tree type_d = TREE_TYPE (dest);
|
|
tree type_o = TREE_TYPE (orig);
|
|
|
|
/* Do not copy between types for which we *do* need a conversion. */
|
|
if (!tree_ssa_useless_type_conversion_1 (type_d, type_o))
|
|
return false;
|
|
|
|
/* FIXME. GIMPLE is allowing pointer assignments and comparisons of
|
|
pointers that have different alias sets. This means that these
|
|
pointers will have different memory tags associated to them.
|
|
|
|
If we allow copy propagation in these cases, statements de-referencing
|
|
the new pointer will now have a reference to a different memory tag
|
|
with potentially incorrect SSA information.
|
|
|
|
This was showing up in libjava/java/util/zip/ZipFile.java with code
|
|
like:
|
|
|
|
struct java.io.BufferedInputStream *T.660;
|
|
struct java.io.BufferedInputStream *T.647;
|
|
struct java.io.InputStream *is;
|
|
struct java.io.InputStream *is.662;
|
|
[ ... ]
|
|
T.660 = T.647;
|
|
is = T.660; <-- This ought to be type-casted
|
|
is.662 = is;
|
|
|
|
Also, f/name.c exposed a similar problem with a COND_EXPR predicate
|
|
that was causing DOM to generate and equivalence with two pointers of
|
|
alias-incompatible types:
|
|
|
|
struct _ffename_space *n;
|
|
struct _ffename *ns;
|
|
[ ... ]
|
|
if (n == ns)
|
|
goto lab;
|
|
...
|
|
lab:
|
|
return n;
|
|
|
|
I think that GIMPLE should emit the appropriate type-casts. For the
|
|
time being, blocking copy-propagation in these cases is the safe thing
|
|
to do. */
|
|
if (TREE_CODE (dest) == SSA_NAME && TREE_CODE (orig) == SSA_NAME
|
|
&& POINTER_TYPE_P (type_d) && POINTER_TYPE_P (type_o))
|
|
{
|
|
tree mt_dest = var_ann (SSA_NAME_VAR (dest))->type_mem_tag;
|
|
tree mt_orig = var_ann (SSA_NAME_VAR (orig))->type_mem_tag;
|
|
if (mt_dest && mt_orig && mt_dest != mt_orig)
|
|
return false;
|
|
else if (!lang_hooks.types_compatible_p (type_d, type_o))
|
|
return false;
|
|
else if (!alias_sets_conflict_p (get_alias_set (type_d),
|
|
get_alias_set (type_o)))
|
|
return false;
|
|
}
|
|
|
|
/* If the destination is a SSA_NAME for a virtual operand, then we have
|
|
some special cases to handle. */
|
|
if (TREE_CODE (dest) == SSA_NAME && !is_gimple_reg (dest))
|
|
{
|
|
/* If both operands are SSA_NAMEs referring to virtual operands, then
|
|
we can always propagate. */
|
|
if (TREE_CODE (orig) == SSA_NAME)
|
|
{
|
|
if (!is_gimple_reg (orig))
|
|
return true;
|
|
|
|
#ifdef ENABLE_CHECKING
|
|
/* If we have one real and one virtual operand, then something has
|
|
gone terribly wrong. */
|
|
gcc_assert (!is_gimple_reg (orig));
|
|
#endif
|
|
}
|
|
|
|
/* We have a "copy" from something like a constant into a virtual
|
|
operand. Reject these. */
|
|
return false;
|
|
}
|
|
|
|
/* If ORIG flows in from an abnormal edge, it cannot be propagated. */
|
|
if (TREE_CODE (orig) == SSA_NAME
|
|
&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (orig))
|
|
return false;
|
|
|
|
/* If DEST is an SSA_NAME that flows from an abnormal edge or if it
|
|
represents a hard register, then it cannot be replaced. */
|
|
if (TREE_CODE (dest) == SSA_NAME
|
|
&& (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (dest)
|
|
|| DECL_HARD_REGISTER (SSA_NAME_VAR (dest))))
|
|
return false;
|
|
|
|
/* Anything else is OK. */
|
|
return true;
|
|
}
|
|
|
|
|
|
/* Given two SSA_NAMEs pointers ORIG and NEW such that we are copy
|
|
propagating NEW into ORIG, consolidate aliasing information so that
|
|
they both share the same memory tags. */
|
|
|
|
static void
|
|
merge_alias_info (tree orig, tree new)
|
|
{
|
|
tree new_sym = SSA_NAME_VAR (new);
|
|
tree orig_sym = SSA_NAME_VAR (orig);
|
|
var_ann_t new_ann = var_ann (new_sym);
|
|
var_ann_t orig_ann = var_ann (orig_sym);
|
|
|
|
gcc_assert (POINTER_TYPE_P (TREE_TYPE (orig)));
|
|
gcc_assert (POINTER_TYPE_P (TREE_TYPE (new)));
|
|
#if defined ENABLE_CHECKING
|
|
gcc_assert (lang_hooks.types_compatible_p (TREE_TYPE (orig),
|
|
TREE_TYPE (new)));
|
|
|
|
/* If the pointed-to alias sets are different, these two pointers
|
|
would never have the same memory tag. In this case, NEW should
|
|
not have been propagated into ORIG. */
|
|
gcc_assert (get_alias_set (TREE_TYPE (TREE_TYPE (new_sym)))
|
|
== get_alias_set (TREE_TYPE (TREE_TYPE (orig_sym))));
|
|
#endif
|
|
|
|
/* Merge type-based alias info. */
|
|
if (new_ann->type_mem_tag == NULL_TREE)
|
|
new_ann->type_mem_tag = orig_ann->type_mem_tag;
|
|
else if (orig_ann->type_mem_tag == NULL_TREE)
|
|
orig_ann->type_mem_tag = new_ann->type_mem_tag;
|
|
else
|
|
gcc_assert (new_ann->type_mem_tag == orig_ann->type_mem_tag);
|
|
}
|
|
|
|
|
|
/* Common code for propagate_value and replace_exp.
|
|
|
|
Replace use operand OP_P with VAL. FOR_PROPAGATION indicates if the
|
|
replacement is done to propagate a value or not. */
|
|
|
|
static void
|
|
replace_exp_1 (use_operand_p op_p, tree val,
|
|
bool for_propagation ATTRIBUTE_UNUSED)
|
|
{
|
|
tree op = USE_FROM_PTR (op_p);
|
|
|
|
#if defined ENABLE_CHECKING
|
|
gcc_assert (!(for_propagation
|
|
&& TREE_CODE (op) == SSA_NAME
|
|
&& TREE_CODE (val) == SSA_NAME
|
|
&& !may_propagate_copy (op, val)));
|
|
#endif
|
|
|
|
if (TREE_CODE (val) == SSA_NAME)
|
|
{
|
|
if (TREE_CODE (op) == SSA_NAME && POINTER_TYPE_P (TREE_TYPE (op)))
|
|
merge_alias_info (op, val);
|
|
SET_USE (op_p, val);
|
|
}
|
|
else
|
|
SET_USE (op_p, unsave_expr_now (val));
|
|
}
|
|
|
|
|
|
/* Propagate the value VAL (assumed to be a constant or another SSA_NAME)
|
|
into the operand pointed by OP_P.
|
|
|
|
Use this version for const/copy propagation as it will perform additional
|
|
checks to ensure validity of the const/copy propagation. */
|
|
|
|
void
|
|
propagate_value (use_operand_p op_p, tree val)
|
|
{
|
|
replace_exp_1 (op_p, val, true);
|
|
}
|
|
|
|
|
|
/* Propagate the value VAL (assumed to be a constant or another SSA_NAME)
|
|
into the tree pointed by OP_P.
|
|
|
|
Use this version for const/copy propagation when SSA operands are not
|
|
available. It will perform the additional checks to ensure validity of
|
|
the const/copy propagation, but will not update any operand information.
|
|
Be sure to mark the stmt as modified. */
|
|
|
|
void
|
|
propagate_tree_value (tree *op_p, tree val)
|
|
{
|
|
#if defined ENABLE_CHECKING
|
|
gcc_assert (!(TREE_CODE (val) == SSA_NAME
|
|
&& TREE_CODE (*op_p) == SSA_NAME
|
|
&& !may_propagate_copy (*op_p, val)));
|
|
#endif
|
|
|
|
if (TREE_CODE (val) == SSA_NAME)
|
|
{
|
|
if (TREE_CODE (*op_p) == SSA_NAME && POINTER_TYPE_P (TREE_TYPE (*op_p)))
|
|
merge_alias_info (*op_p, val);
|
|
*op_p = val;
|
|
}
|
|
else
|
|
*op_p = unsave_expr_now (val);
|
|
}
|
|
|
|
|
|
/* Replace *OP_P with value VAL (assumed to be a constant or another SSA_NAME).
|
|
|
|
Use this version when not const/copy propagating values. For example,
|
|
PRE uses this version when building expressions as they would appear
|
|
in specific blocks taking into account actions of PHI nodes. */
|
|
|
|
void
|
|
replace_exp (use_operand_p op_p, tree val)
|
|
{
|
|
replace_exp_1 (op_p, val, false);
|
|
}
|