2004-05-13 08:41:07 +02:00
|
|
|
|
/* Exception handling semantics and decomposition for trees.
|
2007-01-28 06:15:06 +01:00
|
|
|
|
Copyright (C) 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
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
|
2005-06-25 04:02:01 +02:00
|
|
|
|
the Free Software Foundation, 51 Franklin Street, Fifth Floor,
|
|
|
|
|
Boston, MA 02110-1301, USA. */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
|
#include "system.h"
|
|
|
|
|
#include "coretypes.h"
|
|
|
|
|
#include "tm.h"
|
|
|
|
|
#include "tree.h"
|
|
|
|
|
#include "rtl.h"
|
|
|
|
|
#include "tm_p.h"
|
|
|
|
|
#include "flags.h"
|
|
|
|
|
#include "function.h"
|
|
|
|
|
#include "except.h"
|
|
|
|
|
#include "tree-flow.h"
|
|
|
|
|
#include "tree-dump.h"
|
|
|
|
|
#include "tree-inline.h"
|
|
|
|
|
#include "tree-iterator.h"
|
|
|
|
|
#include "tree-pass.h"
|
|
|
|
|
#include "timevar.h"
|
|
|
|
|
#include "langhooks.h"
|
|
|
|
|
#include "ggc.h"
|
basic-block.h, [...]: Don't include errors.h and include toplev.h if necessary.
* basic-block.h, bb-reorder.c, c-gimplify.c, config/darwin.c,
config/rs6000/rs6000-c.c, dominance.c, gimple-low.c, gimplify.c,
lambda-code.c, lambda-trans.c, tree-browser.c, tree-cfg.c,
tree-chrec.c, tree-data-ref.c, tree-dfa.c, tree-eh.c,
tree-if-conv.c, tree-into-ssa.c, tree-loop-linear.c,
tree-mudflap.c, tree-nomudflap.c, tree-outof-ssa.c,
tree-pretty-print.c, tree-scalar-evolution.c, tree-sra.c,
tree-ssa-ccp.c, tree-ssa-copy.c, tree-ssa-dce.c, tree-ssa-dom.c,
tree-ssa-dse.c, tree-ssa-forwprop.c, tree-ssa-live.c,
tree-ssa-operands.c, tree-ssa-phiopt.c, tree-ssa-pre.c,
tree-ssa-propagate.c, tree-ssa-sink.c, tree-ssa-threadupdate.c,
tree-ssa-uncprop.c, tree-ssa.c, tree-vect-analyze.c,
tree-vect-transform.c, tree-vectorizer.c, vec.c: Don't include
errors.h and include toplev.h if necessary.
* rtl.c, varray.c: If we're compiling as a GENERATOR_FILE, include
errors.h otherwise include toplev.h.
* Makefile.in: Update dependencies.
ada:
* misc.c: Don't include errors.h.
fortran:
* fortran/trans-decl.c: Don't include errors.h.
* fortran/Make-lang.in: Updates dependencies.
java:
* java/verify-glue.c: Don't include errors.h and include toplev.h.
* java/Make-lang.in: Updates dependencies.
treelang:
* treelang/lex.l, treelang/parse.y: Don't include errors.h and
include toplev.h.
* treelang/Make-lang.in: Updates dependencies.
From-SVN: r100420
2005-06-01 04:51:18 +02:00
|
|
|
|
#include "toplev.h"
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
cfgcleanup.c (try_simplify_condjump): Don't remove line notes to avoid unreachable code warnings.
* cfgcleanup.c (try_simplify_condjump): Don't remove line
notes to avoid unreachable code warnings.
* toplev.c (backend_init): Don't emit line notes for
unreachable code warnings.
* combine.c (distribute_notes): Don't distribute a
REG_VTABLE_REF note.
* final.c (final_scan_insn): Don't handle it.
* rtl.c (reg_note_name): Remove it.
* rtl.h (enum reg_node): Dito.
* emit-rtl.c (force_line_numbers, restore_line_number_status):
Remove.
* rtl.h (force_line_numbers, restore_line_number_status):
Remove prototypes.
* stmt.c (using_eh_for_cleanups_p, using_eh_for_cleanups): Move...
* tree-eh.c (using_eh_for_cleanups_p): ...here. Make static.
(using_eh_for_cleanups): Also moved here.
* expr.c (expand_expr_real_1) <CASE_LABEL_EXPR>: Die if we see one.
<SWITCH_EXPR>: Die if we have a non-NULL SWITCH_BODY. Update calls
to expand_start_case and add_case_node.
* stmt.c (struct nesting): Cleanup unused fields condition_code,
last_unconditional_cleanup, nominal_type, printname, and
line_number_status.
(struct fixup_goto): Remove.
(struct stmt_status): Remove x_goto_fixup_chain field.
(goto_fixup_chain): Remove.
(strip_default_case_nodes, group_case_nodes, emit_jump_if_reachable,
pushcase, pushcase_range): Remove.
(expand_start_bindings_and_block): Don't set unused fields in
the nesting stack.
(expand_start_case, add_case_node): Cleanup unused formal arguments.
(expand_end_case_type): Don't simplify the case-list. Use emit_jump
instead of emit_jump_if_reachable.
(emit_case_nodes): Likewise.
* tree-cfg.c (group_case_labels, cleanup_dead_labels): No longer
static.
(update_eh_label): Work around left-over exception handing regions.
* tree-flow.h (group_case_labels, cleanup_dead_labels): Add protos.
* tree-optimize.c (execute_cleanup_cfg_post_optimizing): New function.
(pass_cleanup_cfg_post_optimizing): New pass.
(init_tree_optimization_passes): Run the new pass after all
optimizations.
* tree.h (pushcase, pushcase_range): Remove prototypes.
(expand_start_case, add_case_node): Update prototypes.
cp/
* cp-tree.h (struct lang_type): Don't have three GTY options on a
single bit GTY desc.
java/
* parse.y (java_complete_expand_methods, java_expand_classes): Don't
abuse restore_line_number_status.
From-SVN: r84849
2004-07-17 02:31:15 +02:00
|
|
|
|
|
|
|
|
|
/* Nonzero if we are using EH to handle cleanups. */
|
|
|
|
|
static int using_eh_for_cleanups_p = 0;
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
using_eh_for_cleanups (void)
|
|
|
|
|
{
|
|
|
|
|
using_eh_for_cleanups_p = 1;
|
|
|
|
|
}
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
/* Misc functions used in this file. */
|
|
|
|
|
|
|
|
|
|
/* Compare and hash for any structure which begins with a canonical
|
cgraphunit.c, [...]: Fix comment typos.
* cgraphunit.c, dbxout.c, flow.c, gcse.c, gimplify.c,
lambda-code.c, loop.c, machmode.def, mips-tfile.c,
modulo-sched.c, passes.c, postreload-gcse.c, tree-eh.c,
tree-ssa-ccp.c, varasm.c, config/frv/frv.c, config/frv/frv.h,
config/frv/frv.md, config/i386/i386.c, config/i386/i386.h,
config/i386/i386.md, config/rs6000/predicates.md,
config/rs6000/rs6000.c, config/s390/fixdfdi.h,
config/s390/s390.c, config/stormy16/stormy16.c,
config/stormy16/stormy16.md, config/vax/vax.md: Fix comment
typos.
From-SVN: r97362
2005-04-01 05:42:55 +02:00
|
|
|
|
pointer. Assumes all pointers are interchangeable, which is sort
|
2004-05-13 08:41:07 +02:00
|
|
|
|
of already assumed by gcc elsewhere IIRC. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
struct_ptr_eq (const void *a, const void *b)
|
|
|
|
|
{
|
2005-12-18 02:19:20 +01:00
|
|
|
|
const void * const * x = (const void * const *) a;
|
|
|
|
|
const void * const * y = (const void * const *) b;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
return *x == *y;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static hashval_t
|
|
|
|
|
struct_ptr_hash (const void *a)
|
|
|
|
|
{
|
2005-12-18 02:19:20 +01:00
|
|
|
|
const void * const * x = (const void * const *) a;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
return (size_t)*x >> 4;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Remember and lookup EH region data for arbitrary statements.
|
|
|
|
|
Really this means any statement that could_throw_p. We could
|
|
|
|
|
stuff this information into the stmt_ann data structure, but:
|
|
|
|
|
|
|
|
|
|
(1) We absolutely rely on this information being kept until
|
|
|
|
|
we get to rtl. Once we're done with lowering here, if we lose
|
|
|
|
|
the information there's no way to recover it!
|
|
|
|
|
|
2004-08-19 23:34:37 +02:00
|
|
|
|
(2) There are many more statements that *cannot* throw as
|
2004-05-13 08:41:07 +02:00
|
|
|
|
compared to those that can. We should be saving some amount
|
|
|
|
|
of space by only allocating memory for those that can throw. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
record_stmt_eh_region (struct eh_region *region, tree t)
|
|
|
|
|
{
|
|
|
|
|
if (!region)
|
|
|
|
|
return;
|
|
|
|
|
|
2005-05-14 16:27:09 +02:00
|
|
|
|
add_stmt_to_eh_region (t, get_eh_region_number (region));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
2005-05-11 18:25:30 +02:00
|
|
|
|
add_stmt_to_eh_region_fn (struct function *ifun, tree t, int num)
|
2004-05-13 08:41:07 +02:00
|
|
|
|
{
|
|
|
|
|
struct throw_stmt_node *n;
|
|
|
|
|
void **slot;
|
|
|
|
|
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
gcc_assert (num >= 0);
|
2005-05-11 18:25:30 +02:00
|
|
|
|
gcc_assert (TREE_CODE (t) != RESX_EXPR);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
2005-12-18 02:19:20 +01:00
|
|
|
|
n = GGC_NEW (struct throw_stmt_node);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
n->stmt = t;
|
|
|
|
|
n->region_nr = num;
|
|
|
|
|
|
2005-05-12 21:29:21 +02:00
|
|
|
|
if (!get_eh_throw_stmt_table (ifun))
|
|
|
|
|
set_eh_throw_stmt_table (ifun, htab_create_ggc (31, struct_ptr_hash,
|
|
|
|
|
struct_ptr_eq,
|
|
|
|
|
ggc_free));
|
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
slot = htab_find_slot (get_eh_throw_stmt_table (ifun), n, INSERT);
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
gcc_assert (!*slot);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
*slot = n;
|
|
|
|
|
}
|
2004-06-29 08:59:35 +02:00
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
void
|
|
|
|
|
add_stmt_to_eh_region (tree t, int num)
|
|
|
|
|
{
|
|
|
|
|
add_stmt_to_eh_region_fn (cfun, t, num);
|
|
|
|
|
}
|
|
|
|
|
|
2004-06-29 08:59:35 +02:00
|
|
|
|
bool
|
2005-05-11 18:25:30 +02:00
|
|
|
|
remove_stmt_from_eh_region_fn (struct function *ifun, tree t)
|
2004-06-29 08:59:35 +02:00
|
|
|
|
{
|
|
|
|
|
struct throw_stmt_node dummy;
|
|
|
|
|
void **slot;
|
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
if (!get_eh_throw_stmt_table (ifun))
|
2004-06-29 08:59:35 +02:00
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
dummy.stmt = t;
|
2005-05-11 18:25:30 +02:00
|
|
|
|
slot = htab_find_slot (get_eh_throw_stmt_table (ifun), &dummy,
|
|
|
|
|
NO_INSERT);
|
2004-06-29 08:59:35 +02:00
|
|
|
|
if (slot)
|
|
|
|
|
{
|
2005-05-11 18:25:30 +02:00
|
|
|
|
htab_clear_slot (get_eh_throw_stmt_table (ifun), slot);
|
2004-06-29 08:59:35 +02:00
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
bool
|
|
|
|
|
remove_stmt_from_eh_region (tree t)
|
|
|
|
|
{
|
|
|
|
|
return remove_stmt_from_eh_region_fn (cfun, t);
|
|
|
|
|
}
|
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
int
|
2005-05-11 18:25:30 +02:00
|
|
|
|
lookup_stmt_eh_region_fn (struct function *ifun, tree t)
|
2004-05-13 08:41:07 +02:00
|
|
|
|
{
|
|
|
|
|
struct throw_stmt_node *p, n;
|
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
if (!get_eh_throw_stmt_table (ifun))
|
2004-05-13 08:41:07 +02:00
|
|
|
|
return -2;
|
|
|
|
|
|
|
|
|
|
n.stmt = t;
|
2005-12-18 02:19:20 +01:00
|
|
|
|
p = (struct throw_stmt_node *) htab_find (get_eh_throw_stmt_table (ifun),
|
|
|
|
|
&n);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
return (p ? p->region_nr : -1);
|
|
|
|
|
}
|
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
int
|
|
|
|
|
lookup_stmt_eh_region (tree t)
|
|
|
|
|
{
|
|
|
|
|
/* We can get called from initialized data when -fnon-call-exceptions
|
|
|
|
|
is on; prevent crash. */
|
|
|
|
|
if (!cfun)
|
|
|
|
|
return -1;
|
|
|
|
|
return lookup_stmt_eh_region_fn (cfun, t);
|
|
|
|
|
}
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* First pass of EH node decomposition. Build up a tree of TRY_FINALLY_EXPR
|
|
|
|
|
nodes and LABEL_DECL nodes. We will use this during the second phase to
|
|
|
|
|
determine if a goto leaves the body of a TRY_FINALLY_EXPR node. */
|
|
|
|
|
|
|
|
|
|
struct finally_tree_node
|
|
|
|
|
{
|
|
|
|
|
tree child, parent;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Note that this table is *not* marked GTY. It is short-lived. */
|
|
|
|
|
static htab_t finally_tree;
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
record_in_finally_tree (tree child, tree parent)
|
|
|
|
|
{
|
|
|
|
|
struct finally_tree_node *n;
|
|
|
|
|
void **slot;
|
|
|
|
|
|
2005-12-18 02:19:20 +01:00
|
|
|
|
n = XNEW (struct finally_tree_node);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
n->child = child;
|
|
|
|
|
n->parent = parent;
|
|
|
|
|
|
|
|
|
|
slot = htab_find_slot (finally_tree, n, INSERT);
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
gcc_assert (!*slot);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
*slot = n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
collect_finally_tree (tree t, tree region)
|
|
|
|
|
{
|
|
|
|
|
tailrecurse:
|
|
|
|
|
switch (TREE_CODE (t))
|
|
|
|
|
{
|
|
|
|
|
case LABEL_EXPR:
|
|
|
|
|
record_in_finally_tree (LABEL_EXPR_LABEL (t), region);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case TRY_FINALLY_EXPR:
|
|
|
|
|
record_in_finally_tree (t, region);
|
|
|
|
|
collect_finally_tree (TREE_OPERAND (t, 0), t);
|
|
|
|
|
t = TREE_OPERAND (t, 1);
|
|
|
|
|
goto tailrecurse;
|
|
|
|
|
|
|
|
|
|
case TRY_CATCH_EXPR:
|
|
|
|
|
collect_finally_tree (TREE_OPERAND (t, 0), region);
|
|
|
|
|
t = TREE_OPERAND (t, 1);
|
|
|
|
|
goto tailrecurse;
|
|
|
|
|
|
|
|
|
|
case CATCH_EXPR:
|
|
|
|
|
t = CATCH_BODY (t);
|
|
|
|
|
goto tailrecurse;
|
|
|
|
|
|
|
|
|
|
case EH_FILTER_EXPR:
|
|
|
|
|
t = EH_FILTER_FAILURE (t);
|
|
|
|
|
goto tailrecurse;
|
|
|
|
|
|
|
|
|
|
case STATEMENT_LIST:
|
|
|
|
|
{
|
|
|
|
|
tree_stmt_iterator i;
|
|
|
|
|
for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
|
|
|
|
|
collect_finally_tree (tsi_stmt (i), region);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
/* A type, a decl, or some kind of statement that we're not
|
|
|
|
|
interested in. Don't walk them. */
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Use the finally tree to determine if a jump from START to TARGET
|
|
|
|
|
would leave the try_finally node that START lives in. */
|
|
|
|
|
|
|
|
|
|
static bool
|
|
|
|
|
outside_finally_tree (tree start, tree target)
|
|
|
|
|
{
|
|
|
|
|
struct finally_tree_node n, *p;
|
|
|
|
|
|
|
|
|
|
do
|
|
|
|
|
{
|
|
|
|
|
n.child = start;
|
2005-12-18 02:19:20 +01:00
|
|
|
|
p = (struct finally_tree_node *) htab_find (finally_tree, &n);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (!p)
|
|
|
|
|
return true;
|
|
|
|
|
start = p->parent;
|
|
|
|
|
}
|
|
|
|
|
while (start != target);
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Second pass of EH node decomposition. Actually transform the TRY_FINALLY
|
|
|
|
|
and TRY_CATCH nodes into a set of gotos, magic labels, and eh regions.
|
|
|
|
|
The eh region creation is straight-forward, but frobbing all the gotos
|
|
|
|
|
and such into shape isn't. */
|
|
|
|
|
|
|
|
|
|
/* State of the world while lowering. */
|
|
|
|
|
|
|
|
|
|
struct leh_state
|
|
|
|
|
{
|
2004-08-19 23:34:37 +02:00
|
|
|
|
/* What's "current" while constructing the eh region tree. These
|
2004-05-13 08:41:07 +02:00
|
|
|
|
correspond to variables of the same name in cfun->eh, which we
|
|
|
|
|
don't have easy access to. */
|
|
|
|
|
struct eh_region *cur_region;
|
|
|
|
|
struct eh_region *prev_try;
|
|
|
|
|
|
|
|
|
|
/* Processing of TRY_FINALLY requires a bit more state. This is
|
|
|
|
|
split out into a separate structure so that we don't have to
|
|
|
|
|
copy so much when processing other nodes. */
|
|
|
|
|
struct leh_tf_state *tf;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct leh_tf_state
|
|
|
|
|
{
|
|
|
|
|
/* Pointer to the TRY_FINALLY node under discussion. The try_finally_expr
|
2004-08-19 23:34:37 +02:00
|
|
|
|
is the original TRY_FINALLY_EXPR. We need to retain this so that
|
2004-05-13 08:41:07 +02:00
|
|
|
|
outside_finally_tree can reliably reference the tree used in the
|
|
|
|
|
collect_finally_tree data structures. */
|
|
|
|
|
tree try_finally_expr;
|
|
|
|
|
tree *top_p;
|
|
|
|
|
|
|
|
|
|
/* The state outside this try_finally node. */
|
|
|
|
|
struct leh_state *outer;
|
|
|
|
|
|
|
|
|
|
/* The exception region created for it. */
|
|
|
|
|
struct eh_region *region;
|
|
|
|
|
|
|
|
|
|
/* The GOTO_QUEUE is is an array of GOTO_EXPR and RETURN_EXPR statements
|
|
|
|
|
that are seen to escape this TRY_FINALLY_EXPR node. */
|
|
|
|
|
struct goto_queue_node {
|
|
|
|
|
tree stmt;
|
|
|
|
|
tree repl_stmt;
|
|
|
|
|
tree cont_stmt;
|
|
|
|
|
int index;
|
|
|
|
|
} *goto_queue;
|
|
|
|
|
size_t goto_queue_size;
|
|
|
|
|
size_t goto_queue_active;
|
|
|
|
|
|
|
|
|
|
/* The set of unique labels seen as entries in the goto queue. */
|
2005-05-14 05:25:44 +02:00
|
|
|
|
VEC(tree,heap) *dest_array;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
/* A label to be added at the end of the completed transformed
|
|
|
|
|
sequence. It will be set if may_fallthru was true *at one time*,
|
|
|
|
|
though subsequent transformations may have cleared that flag. */
|
|
|
|
|
tree fallthru_label;
|
|
|
|
|
|
2004-08-19 23:34:37 +02:00
|
|
|
|
/* A label that has been registered with except.c to be the
|
2004-05-13 08:41:07 +02:00
|
|
|
|
landing pad for this try block. */
|
|
|
|
|
tree eh_label;
|
|
|
|
|
|
|
|
|
|
/* True if it is possible to fall out the bottom of the try block.
|
|
|
|
|
Cleared if the fallthru is converted to a goto. */
|
|
|
|
|
bool may_fallthru;
|
|
|
|
|
|
|
|
|
|
/* True if any entry in goto_queue is a RETURN_EXPR. */
|
|
|
|
|
bool may_return;
|
|
|
|
|
|
|
|
|
|
/* True if the finally block can receive an exception edge.
|
|
|
|
|
Cleared if the exception case is handled by code duplication. */
|
|
|
|
|
bool may_throw;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static void lower_eh_filter (struct leh_state *, tree *);
|
|
|
|
|
static void lower_eh_constructs_1 (struct leh_state *, tree *);
|
|
|
|
|
|
2004-08-19 23:34:37 +02:00
|
|
|
|
/* Comparison function for qsort/bsearch. We're interested in
|
2004-05-13 08:41:07 +02:00
|
|
|
|
searching goto queue elements for source statements. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
goto_queue_cmp (const void *x, const void *y)
|
|
|
|
|
{
|
|
|
|
|
tree a = ((const struct goto_queue_node *)x)->stmt;
|
|
|
|
|
tree b = ((const struct goto_queue_node *)y)->stmt;
|
|
|
|
|
return (a == b ? 0 : a < b ? -1 : 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Search for STMT in the goto queue. Return the replacement,
|
|
|
|
|
or null if the statement isn't in the queue. */
|
|
|
|
|
|
|
|
|
|
static tree
|
|
|
|
|
find_goto_replacement (struct leh_tf_state *tf, tree stmt)
|
|
|
|
|
{
|
|
|
|
|
struct goto_queue_node tmp, *ret;
|
|
|
|
|
tmp.stmt = stmt;
|
2005-12-18 02:19:20 +01:00
|
|
|
|
ret = (struct goto_queue_node *)
|
|
|
|
|
bsearch (&tmp, tf->goto_queue, tf->goto_queue_active,
|
2004-05-13 08:41:07 +02:00
|
|
|
|
sizeof (struct goto_queue_node), goto_queue_cmp);
|
|
|
|
|
return (ret ? ret->repl_stmt : NULL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of replace_goto_queue_1. Handles the sub-clauses of a
|
|
|
|
|
lowered COND_EXPR. If, by chance, the replacement is a simple goto,
|
|
|
|
|
then we can just splat it in, otherwise we add the new stmts immediately
|
|
|
|
|
after the COND_EXPR and redirect. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
replace_goto_queue_cond_clause (tree *tp, struct leh_tf_state *tf,
|
|
|
|
|
tree_stmt_iterator *tsi)
|
|
|
|
|
{
|
|
|
|
|
tree new, one, label;
|
|
|
|
|
|
|
|
|
|
new = find_goto_replacement (tf, *tp);
|
|
|
|
|
if (!new)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
one = expr_only (new);
|
|
|
|
|
if (one && TREE_CODE (one) == GOTO_EXPR)
|
|
|
|
|
{
|
|
|
|
|
*tp = one;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
|
|
|
|
|
*tp = build_and_jump (&LABEL_EXPR_LABEL (label));
|
|
|
|
|
|
|
|
|
|
tsi_link_after (tsi, label, TSI_CONTINUE_LINKING);
|
|
|
|
|
tsi_link_after (tsi, new, TSI_CONTINUE_LINKING);
|
|
|
|
|
}
|
|
|
|
|
|
2004-08-19 23:34:37 +02:00
|
|
|
|
/* The real work of replace_goto_queue. Returns with TSI updated to
|
2004-05-13 08:41:07 +02:00
|
|
|
|
point to the next statement. */
|
|
|
|
|
|
|
|
|
|
static void replace_goto_queue_stmt_list (tree, struct leh_tf_state *);
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
replace_goto_queue_1 (tree t, struct leh_tf_state *tf, tree_stmt_iterator *tsi)
|
|
|
|
|
{
|
|
|
|
|
switch (TREE_CODE (t))
|
|
|
|
|
{
|
|
|
|
|
case GOTO_EXPR:
|
|
|
|
|
case RETURN_EXPR:
|
|
|
|
|
t = find_goto_replacement (tf, t);
|
|
|
|
|
if (t)
|
|
|
|
|
{
|
|
|
|
|
tsi_link_before (tsi, t, TSI_SAME_STMT);
|
|
|
|
|
tsi_delink (tsi);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case COND_EXPR:
|
|
|
|
|
replace_goto_queue_cond_clause (&COND_EXPR_THEN (t), tf, tsi);
|
|
|
|
|
replace_goto_queue_cond_clause (&COND_EXPR_ELSE (t), tf, tsi);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case TRY_FINALLY_EXPR:
|
|
|
|
|
case TRY_CATCH_EXPR:
|
|
|
|
|
replace_goto_queue_stmt_list (TREE_OPERAND (t, 0), tf);
|
|
|
|
|
replace_goto_queue_stmt_list (TREE_OPERAND (t, 1), tf);
|
|
|
|
|
break;
|
|
|
|
|
case CATCH_EXPR:
|
|
|
|
|
replace_goto_queue_stmt_list (CATCH_BODY (t), tf);
|
|
|
|
|
break;
|
|
|
|
|
case EH_FILTER_EXPR:
|
|
|
|
|
replace_goto_queue_stmt_list (EH_FILTER_FAILURE (t), tf);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case STATEMENT_LIST:
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
gcc_unreachable ();
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
/* These won't have gotos in them. */
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
tsi_next (tsi);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of replace_goto_queue. Handles STATEMENT_LISTs. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
replace_goto_queue_stmt_list (tree t, struct leh_tf_state *tf)
|
|
|
|
|
{
|
|
|
|
|
tree_stmt_iterator i = tsi_start (t);
|
|
|
|
|
while (!tsi_end_p (i))
|
|
|
|
|
replace_goto_queue_1 (tsi_stmt (i), tf, &i);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Replace all goto queue members. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
replace_goto_queue (struct leh_tf_state *tf)
|
|
|
|
|
{
|
2005-01-04 13:45:42 +01:00
|
|
|
|
if (tf->goto_queue_active == 0)
|
|
|
|
|
return;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
replace_goto_queue_stmt_list (*tf->top_p, tf);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* For any GOTO_EXPR or RETURN_EXPR, decide whether it leaves a try_finally
|
|
|
|
|
node, and if so record that fact in the goto queue associated with that
|
|
|
|
|
try_finally node. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
maybe_record_in_goto_queue (struct leh_state *state, tree stmt)
|
|
|
|
|
{
|
|
|
|
|
struct leh_tf_state *tf = state->tf;
|
|
|
|
|
struct goto_queue_node *q;
|
|
|
|
|
size_t active, size;
|
|
|
|
|
int index;
|
|
|
|
|
|
|
|
|
|
if (!tf)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
switch (TREE_CODE (stmt))
|
|
|
|
|
{
|
|
|
|
|
case GOTO_EXPR:
|
|
|
|
|
{
|
|
|
|
|
tree lab = GOTO_DESTINATION (stmt);
|
|
|
|
|
|
2004-08-19 23:34:37 +02:00
|
|
|
|
/* Computed and non-local gotos do not get processed. Given
|
2004-05-13 08:41:07 +02:00
|
|
|
|
their nature we can neither tell whether we've escaped the
|
|
|
|
|
finally block nor redirect them if we knew. */
|
|
|
|
|
if (TREE_CODE (lab) != LABEL_DECL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
/* No need to record gotos that don't leave the try block. */
|
|
|
|
|
if (! outside_finally_tree (lab, tf->try_finally_expr))
|
|
|
|
|
return;
|
2004-08-19 23:34:37 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (! tf->dest_array)
|
|
|
|
|
{
|
2005-05-14 05:25:44 +02:00
|
|
|
|
tf->dest_array = VEC_alloc (tree, heap, 10);
|
|
|
|
|
VEC_quick_push (tree, tf->dest_array, lab);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
index = 0;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2005-05-14 05:25:44 +02:00
|
|
|
|
int n = VEC_length (tree, tf->dest_array);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
for (index = 0; index < n; ++index)
|
2005-05-14 05:25:44 +02:00
|
|
|
|
if (VEC_index (tree, tf->dest_array, index) == lab)
|
2004-05-13 08:41:07 +02:00
|
|
|
|
break;
|
|
|
|
|
if (index == n)
|
2005-05-14 05:25:44 +02:00
|
|
|
|
VEC_safe_push (tree, heap, tf->dest_array, lab);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case RETURN_EXPR:
|
|
|
|
|
tf->may_return = true;
|
|
|
|
|
index = -1;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
gcc_unreachable ();
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
active = tf->goto_queue_active;
|
|
|
|
|
size = tf->goto_queue_size;
|
|
|
|
|
if (active >= size)
|
|
|
|
|
{
|
|
|
|
|
size = (size ? size * 2 : 32);
|
|
|
|
|
tf->goto_queue_size = size;
|
|
|
|
|
tf->goto_queue
|
2005-12-18 02:19:20 +01:00
|
|
|
|
= XRESIZEVEC (struct goto_queue_node, tf->goto_queue, size);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
q = &tf->goto_queue[active];
|
|
|
|
|
tf->goto_queue_active = active + 1;
|
2004-08-19 23:34:37 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
memset (q, 0, sizeof (*q));
|
|
|
|
|
q->stmt = stmt;
|
|
|
|
|
q->index = index;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#ifdef ENABLE_CHECKING
|
|
|
|
|
/* We do not process SWITCH_EXPRs for now. As long as the original source
|
|
|
|
|
was in fact structured, and we've not yet done jump threading, then none
|
|
|
|
|
of the labels will leave outer TRY_FINALLY_EXPRs. Verify this. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
verify_norecord_switch_expr (struct leh_state *state, tree switch_expr)
|
|
|
|
|
{
|
|
|
|
|
struct leh_tf_state *tf = state->tf;
|
|
|
|
|
size_t i, n;
|
|
|
|
|
tree vec;
|
|
|
|
|
|
|
|
|
|
if (!tf)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
vec = SWITCH_LABELS (switch_expr);
|
|
|
|
|
n = TREE_VEC_LENGTH (vec);
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < n; ++i)
|
|
|
|
|
{
|
|
|
|
|
tree lab = CASE_LABEL (TREE_VEC_ELT (vec, i));
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
gcc_assert (!outside_finally_tree (lab, tf->try_finally_expr));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
#define verify_norecord_switch_expr(state, switch_expr)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Redirect a RETURN_EXPR pointed to by STMT_P to FINLAB. Place in CONT_P
|
|
|
|
|
whatever is needed to finish the return. If MOD is non-null, insert it
|
|
|
|
|
before the new branch. RETURN_VALUE_P is a cache containing a temporary
|
bb-reorder.c, [...]: Fix comment formatting.
* bb-reorder.c, builtins.c, c-common.c, c-gimplify.c,
c-incpath.c, cgraphunit.c, ddg.c, defaults.h, dwarf2out.c,
expmed.c, flags.h, gcc.c, gensupport.c, gimplify.c, global.c,
passes.c, reg-stack.c, target.h, toplev.c, tree-alias-ander.c,
tree-alias-common.c, tree-cfg.c, tree-complex.c, tree-dfa.c,
tree-eh.c, tree-mudflap.c, tree-mudflap.h, tree-outof-ssa.c,
tree-phinodes.c, tree-pretty-print.c, tree-ssa-alias.c,
tree-ssa-ccp.c, tree-ssa-live.c, tree-ssa-live.h,
tree-ssa-pre.c, tree.h, value-prof.h, varasm.c: Fix comment
formatting.
From-SVN: r82463
2004-05-30 20:32:31 +02:00
|
|
|
|
variable to be used in manipulating the value returned from the function. */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
do_return_redirection (struct goto_queue_node *q, tree finlab, tree mod,
|
|
|
|
|
tree *return_value_p)
|
|
|
|
|
{
|
|
|
|
|
tree ret_expr = TREE_OPERAND (q->stmt, 0);
|
|
|
|
|
tree x;
|
|
|
|
|
|
|
|
|
|
if (ret_expr)
|
|
|
|
|
{
|
|
|
|
|
/* The nasty part about redirecting the return value is that the
|
|
|
|
|
return value itself is to be computed before the FINALLY block
|
|
|
|
|
is executed. e.g.
|
|
|
|
|
|
|
|
|
|
int x;
|
|
|
|
|
int foo (void)
|
|
|
|
|
{
|
|
|
|
|
x = 0;
|
|
|
|
|
try {
|
|
|
|
|
return x;
|
|
|
|
|
} finally {
|
|
|
|
|
x++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
should return 0, not 1. Arrange for this to happen by copying
|
|
|
|
|
computed the return value into a local temporary. This also
|
|
|
|
|
allows us to redirect multiple return statements through the
|
|
|
|
|
same destination block; whether this is a net win or not really
|
|
|
|
|
depends, I guess, but it does make generation of the switch in
|
|
|
|
|
lower_try_finally_switch easier. */
|
|
|
|
|
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
switch (TREE_CODE (ret_expr))
|
2004-05-13 08:41:07 +02:00
|
|
|
|
{
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
case RESULT_DECL:
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (!*return_value_p)
|
|
|
|
|
*return_value_p = ret_expr;
|
|
|
|
|
else
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
gcc_assert (*return_value_p == ret_expr);
|
|
|
|
|
q->cont_stmt = q->stmt;
|
|
|
|
|
break;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
2006-12-05 18:26:05 +01:00
|
|
|
|
case GIMPLE_MODIFY_STMT:
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
{
|
2006-12-05 18:26:05 +01:00
|
|
|
|
tree result = GIMPLE_STMT_OPERAND (ret_expr, 0);
|
|
|
|
|
tree new, old = GIMPLE_STMT_OPERAND (ret_expr, 1);
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
|
|
|
|
|
if (!*return_value_p)
|
|
|
|
|
{
|
|
|
|
|
if (aggregate_value_p (TREE_TYPE (result),
|
|
|
|
|
TREE_TYPE (current_function_decl)))
|
|
|
|
|
/* If this function returns in memory, copy the argument
|
|
|
|
|
into the return slot now. Otherwise, we might need to
|
|
|
|
|
worry about magic return semantics, so we need to use a
|
|
|
|
|
temporary to hold the value until we're actually ready
|
|
|
|
|
to return. */
|
|
|
|
|
new = result;
|
|
|
|
|
else
|
|
|
|
|
new = create_tmp_var (TREE_TYPE (old), "rettmp");
|
|
|
|
|
*return_value_p = new;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
new = *return_value_p;
|
|
|
|
|
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, TREE_TYPE (new), new, old);
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
append_to_statement_list (x, &q->repl_stmt);
|
|
|
|
|
|
|
|
|
|
if (new == result)
|
|
|
|
|
x = result;
|
|
|
|
|
else
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, TREE_TYPE (result), result, new);
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
q->cont_stmt = build1 (RETURN_EXPR, void_type_node, x);
|
|
|
|
|
}
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
targhooks.c (default_unwind_emit, [...]): Use gcc_assert, gcc_unreachable & internal_error instead of abort.
* 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
2004-09-09 09:54:12 +02:00
|
|
|
|
default:
|
|
|
|
|
gcc_unreachable ();
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* If we don't return a value, all return statements are the same. */
|
|
|
|
|
q->cont_stmt = q->stmt;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (mod)
|
|
|
|
|
append_to_statement_list (mod, &q->repl_stmt);
|
|
|
|
|
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, finlab);
|
|
|
|
|
append_to_statement_list (x, &q->repl_stmt);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Similar, but easier, for GOTO_EXPR. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
do_goto_redirection (struct goto_queue_node *q, tree finlab, tree mod)
|
|
|
|
|
{
|
|
|
|
|
tree x;
|
|
|
|
|
|
|
|
|
|
q->cont_stmt = q->stmt;
|
|
|
|
|
if (mod)
|
|
|
|
|
append_to_statement_list (mod, &q->repl_stmt);
|
|
|
|
|
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, finlab);
|
|
|
|
|
append_to_statement_list (x, &q->repl_stmt);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* We want to transform
|
|
|
|
|
try { body; } catch { stuff; }
|
|
|
|
|
to
|
|
|
|
|
body; goto over; lab: stuff; over:
|
|
|
|
|
|
|
|
|
|
T is a TRY_FINALLY or TRY_CATCH node. LAB is the label that
|
|
|
|
|
should be placed before the second operand, or NULL. OVER is
|
|
|
|
|
an existing label that should be put at the exit, or NULL. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
frob_into_branch_around (tree *tp, tree lab, tree over)
|
|
|
|
|
{
|
|
|
|
|
tree x, op1;
|
|
|
|
|
|
|
|
|
|
op1 = TREE_OPERAND (*tp, 1);
|
|
|
|
|
*tp = TREE_OPERAND (*tp, 0);
|
|
|
|
|
|
|
|
|
|
if (block_may_fallthru (*tp))
|
|
|
|
|
{
|
|
|
|
|
if (!over)
|
|
|
|
|
over = create_artificial_label ();
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, over);
|
|
|
|
|
append_to_statement_list (x, tp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (lab)
|
|
|
|
|
{
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, lab);
|
|
|
|
|
append_to_statement_list (x, tp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
append_to_statement_list (op1, tp);
|
|
|
|
|
|
|
|
|
|
if (over)
|
|
|
|
|
{
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, over);
|
|
|
|
|
append_to_statement_list (x, tp);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_try_finally. Duplicate the tree rooted at T.
|
|
|
|
|
Make sure to record all new labels found. */
|
|
|
|
|
|
|
|
|
|
static tree
|
|
|
|
|
lower_try_finally_dup_block (tree t, struct leh_state *outer_state)
|
|
|
|
|
{
|
|
|
|
|
tree region = NULL;
|
|
|
|
|
|
2004-08-19 23:34:37 +02:00
|
|
|
|
t = unsave_expr_now (t);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
if (outer_state->tf)
|
|
|
|
|
region = outer_state->tf->try_finally_expr;
|
|
|
|
|
collect_finally_tree (t, region);
|
|
|
|
|
|
|
|
|
|
return t;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_try_finally. Create a fallthru label for
|
|
|
|
|
the given try_finally state. The only tricky bit here is that
|
|
|
|
|
we have to make sure to record the label in our outer context. */
|
|
|
|
|
|
|
|
|
|
static tree
|
|
|
|
|
lower_try_finally_fallthru_label (struct leh_tf_state *tf)
|
|
|
|
|
{
|
|
|
|
|
tree label = tf->fallthru_label;
|
|
|
|
|
if (!label)
|
|
|
|
|
{
|
|
|
|
|
label = create_artificial_label ();
|
|
|
|
|
tf->fallthru_label = label;
|
|
|
|
|
if (tf->outer->tf)
|
2004-08-19 23:34:37 +02:00
|
|
|
|
record_in_finally_tree (label, tf->outer->tf->try_finally_expr);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
return label;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_try_finally. If lang_protect_cleanup_actions
|
|
|
|
|
returns non-null, then the language requires that the exception path out
|
|
|
|
|
of a try_finally be treated specially. To wit: the code within the
|
|
|
|
|
finally block may not itself throw an exception. We have two choices here.
|
|
|
|
|
First we can duplicate the finally block and wrap it in a must_not_throw
|
|
|
|
|
region. Second, we can generate code like
|
|
|
|
|
|
|
|
|
|
try {
|
|
|
|
|
finally_block;
|
|
|
|
|
} catch {
|
|
|
|
|
if (fintmp == eh_edge)
|
|
|
|
|
protect_cleanup_actions;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
where "fintmp" is the temporary used in the switch statement generation
|
|
|
|
|
alternative considered below. For the nonce, we always choose the first
|
2004-08-19 23:34:37 +02:00
|
|
|
|
option.
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
2005-02-24 22:47:26 +01:00
|
|
|
|
THIS_STATE may be null if this is a try-cleanup, not a try-finally. */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
honor_protect_cleanup_actions (struct leh_state *outer_state,
|
|
|
|
|
struct leh_state *this_state,
|
|
|
|
|
struct leh_tf_state *tf)
|
|
|
|
|
{
|
|
|
|
|
tree protect_cleanup_actions, finally, x;
|
|
|
|
|
tree_stmt_iterator i;
|
|
|
|
|
bool finally_may_fallthru;
|
|
|
|
|
|
|
|
|
|
/* First check for nothing to do. */
|
|
|
|
|
if (lang_protect_cleanup_actions)
|
|
|
|
|
protect_cleanup_actions = lang_protect_cleanup_actions ();
|
|
|
|
|
else
|
|
|
|
|
protect_cleanup_actions = NULL;
|
|
|
|
|
|
|
|
|
|
finally = TREE_OPERAND (*tf->top_p, 1);
|
|
|
|
|
|
|
|
|
|
/* If the EH case of the finally block can fall through, this may be a
|
|
|
|
|
structure of the form
|
|
|
|
|
try {
|
|
|
|
|
try {
|
|
|
|
|
throw ...;
|
|
|
|
|
} cleanup {
|
|
|
|
|
try {
|
|
|
|
|
throw ...;
|
|
|
|
|
} catch (...) {
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
} catch (...) {
|
|
|
|
|
yyy;
|
|
|
|
|
}
|
|
|
|
|
E.g. with an inline destructor with an embedded try block. In this
|
|
|
|
|
case we must save the runtime EH data around the nested exception.
|
|
|
|
|
|
|
|
|
|
This complication means that any time the previous runtime data might
|
|
|
|
|
be used (via fallthru from the finally) we handle the eh case here,
|
|
|
|
|
whether or not protect_cleanup_actions is active. */
|
|
|
|
|
|
|
|
|
|
finally_may_fallthru = block_may_fallthru (finally);
|
|
|
|
|
if (!finally_may_fallthru && !protect_cleanup_actions)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
/* Duplicate the FINALLY block. Only need to do this for try-finally,
|
|
|
|
|
and not for cleanups. */
|
|
|
|
|
if (this_state)
|
|
|
|
|
finally = lower_try_finally_dup_block (finally, outer_state);
|
|
|
|
|
|
|
|
|
|
/* Resume execution after the exception. Adding this now lets
|
|
|
|
|
lower_eh_filter not add unnecessary gotos, as it is clear that
|
|
|
|
|
we never fallthru from this copy of the finally block. */
|
|
|
|
|
if (finally_may_fallthru)
|
|
|
|
|
{
|
2004-12-02 16:56:29 +01:00
|
|
|
|
tree save_eptr, save_filt;
|
|
|
|
|
|
|
|
|
|
save_eptr = create_tmp_var (ptr_type_node, "save_eptr");
|
|
|
|
|
save_filt = create_tmp_var (integer_type_node, "save_filt");
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
i = tsi_start (finally);
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build0 (EXC_PTR_EXPR, ptr_type_node);
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, void_type_node, save_eptr, x);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
tsi_link_before (&i, x, TSI_CONTINUE_LINKING);
|
|
|
|
|
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build0 (FILTER_EXPR, integer_type_node);
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, void_type_node, save_filt, x);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
tsi_link_before (&i, x, TSI_CONTINUE_LINKING);
|
|
|
|
|
|
|
|
|
|
i = tsi_last (finally);
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build0 (EXC_PTR_EXPR, ptr_type_node);
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, void_type_node, x, save_eptr);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
tsi_link_after (&i, x, TSI_CONTINUE_LINKING);
|
|
|
|
|
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build0 (FILTER_EXPR, integer_type_node);
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, void_type_node, x, save_filt);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
tsi_link_after (&i, x, TSI_CONTINUE_LINKING);
|
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
x = build_resx (get_eh_region_number (tf->region));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
tsi_link_after (&i, x, TSI_CONTINUE_LINKING);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Wrap the block with protect_cleanup_actions as the action. */
|
|
|
|
|
if (protect_cleanup_actions)
|
|
|
|
|
{
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build2 (EH_FILTER_EXPR, void_type_node, NULL, NULL);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (protect_cleanup_actions, &EH_FILTER_FAILURE (x));
|
|
|
|
|
EH_FILTER_MUST_NOT_THROW (x) = 1;
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
finally = build2 (TRY_CATCH_EXPR, void_type_node, finally, x);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
lower_eh_filter (outer_state, &finally);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
lower_eh_constructs_1 (outer_state, &finally);
|
|
|
|
|
|
|
|
|
|
/* Hook this up to the end of the existing try block. If we
|
|
|
|
|
previously fell through the end, we'll have to branch around.
|
|
|
|
|
This means adding a new goto, and adding it to the queue. */
|
|
|
|
|
|
|
|
|
|
i = tsi_last (TREE_OPERAND (*tf->top_p, 0));
|
|
|
|
|
|
|
|
|
|
if (tf->may_fallthru)
|
|
|
|
|
{
|
|
|
|
|
x = lower_try_finally_fallthru_label (tf);
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, x);
|
|
|
|
|
tsi_link_after (&i, x, TSI_CONTINUE_LINKING);
|
|
|
|
|
|
|
|
|
|
if (this_state)
|
|
|
|
|
maybe_record_in_goto_queue (this_state, x);
|
|
|
|
|
|
|
|
|
|
tf->may_fallthru = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, tf->eh_label);
|
|
|
|
|
tsi_link_after (&i, x, TSI_CONTINUE_LINKING);
|
|
|
|
|
tsi_link_after (&i, finally, TSI_CONTINUE_LINKING);
|
|
|
|
|
|
|
|
|
|
/* Having now been handled, EH isn't to be considered with
|
|
|
|
|
the rest of the outgoing edges. */
|
|
|
|
|
tf->may_throw = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_try_finally. We have determined that there is
|
|
|
|
|
no fallthru edge out of the finally block. This means that there is
|
|
|
|
|
no outgoing edge corresponding to any incoming edge. Restructure the
|
|
|
|
|
try_finally node for this special case. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_try_finally_nofallthru (struct leh_state *state, struct leh_tf_state *tf)
|
|
|
|
|
{
|
|
|
|
|
tree x, finally, lab, return_val;
|
|
|
|
|
struct goto_queue_node *q, *qe;
|
|
|
|
|
|
|
|
|
|
if (tf->may_throw)
|
|
|
|
|
lab = tf->eh_label;
|
|
|
|
|
else
|
|
|
|
|
lab = create_artificial_label ();
|
|
|
|
|
|
|
|
|
|
finally = TREE_OPERAND (*tf->top_p, 1);
|
|
|
|
|
*tf->top_p = TREE_OPERAND (*tf->top_p, 0);
|
|
|
|
|
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, lab);
|
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
|
|
|
|
return_val = NULL;
|
|
|
|
|
q = tf->goto_queue;
|
|
|
|
|
qe = q + tf->goto_queue_active;
|
|
|
|
|
for (; q < qe; ++q)
|
|
|
|
|
if (q->index < 0)
|
|
|
|
|
do_return_redirection (q, lab, NULL, &return_val);
|
|
|
|
|
else
|
|
|
|
|
do_goto_redirection (q, lab, NULL);
|
|
|
|
|
|
|
|
|
|
replace_goto_queue (tf);
|
|
|
|
|
|
|
|
|
|
lower_eh_constructs_1 (state, &finally);
|
|
|
|
|
append_to_statement_list (finally, tf->top_p);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_try_finally. We have determined that there is
|
|
|
|
|
exactly one destination of the finally block. Restructure the
|
|
|
|
|
try_finally node for this special case. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_try_finally_onedest (struct leh_state *state, struct leh_tf_state *tf)
|
|
|
|
|
{
|
|
|
|
|
struct goto_queue_node *q, *qe;
|
|
|
|
|
tree x, finally, finally_label;
|
|
|
|
|
|
|
|
|
|
finally = TREE_OPERAND (*tf->top_p, 1);
|
|
|
|
|
*tf->top_p = TREE_OPERAND (*tf->top_p, 0);
|
|
|
|
|
|
|
|
|
|
lower_eh_constructs_1 (state, &finally);
|
|
|
|
|
|
|
|
|
|
if (tf->may_throw)
|
|
|
|
|
{
|
|
|
|
|
/* Only reachable via the exception edge. Add the given label to
|
|
|
|
|
the head of the FINALLY block. Append a RESX at the end. */
|
|
|
|
|
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, tf->eh_label);
|
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
|
|
|
|
append_to_statement_list (finally, tf->top_p);
|
2004-08-19 23:34:37 +02:00
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
x = build_resx (get_eh_region_number (tf->region));
|
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (tf->may_fallthru)
|
|
|
|
|
{
|
|
|
|
|
/* Only reachable via the fallthru edge. Do nothing but let
|
|
|
|
|
the two blocks run together; we'll fall out the bottom. */
|
|
|
|
|
append_to_statement_list (finally, tf->top_p);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
finally_label = create_artificial_label ();
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, finally_label);
|
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
|
|
|
|
append_to_statement_list (finally, tf->top_p);
|
|
|
|
|
|
|
|
|
|
q = tf->goto_queue;
|
|
|
|
|
qe = q + tf->goto_queue_active;
|
|
|
|
|
|
|
|
|
|
if (tf->may_return)
|
|
|
|
|
{
|
|
|
|
|
/* Reachable by return expressions only. Redirect them. */
|
|
|
|
|
tree return_val = NULL;
|
|
|
|
|
for (; q < qe; ++q)
|
|
|
|
|
do_return_redirection (q, finally_label, NULL, &return_val);
|
|
|
|
|
replace_goto_queue (tf);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Reachable by goto expressions only. Redirect them. */
|
|
|
|
|
for (; q < qe; ++q)
|
|
|
|
|
do_goto_redirection (q, finally_label, NULL);
|
|
|
|
|
replace_goto_queue (tf);
|
2004-08-19 23:34:37 +02:00
|
|
|
|
|
2005-05-14 05:25:44 +02:00
|
|
|
|
if (VEC_index (tree, tf->dest_array, 0) == tf->fallthru_label)
|
2004-05-13 08:41:07 +02:00
|
|
|
|
{
|
|
|
|
|
/* Reachable by goto to fallthru label only. Redirect it
|
|
|
|
|
to the new label (already created, sadly), and do not
|
|
|
|
|
emit the final branch out, or the fallthru label. */
|
|
|
|
|
tf->fallthru_label = NULL;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
append_to_statement_list (tf->goto_queue[0].cont_stmt, tf->top_p);
|
|
|
|
|
maybe_record_in_goto_queue (state, tf->goto_queue[0].cont_stmt);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_try_finally. There are multiple edges incoming
|
|
|
|
|
and outgoing from the finally block. Implement this by duplicating the
|
|
|
|
|
finally block for every destination. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_try_finally_copy (struct leh_state *state, struct leh_tf_state *tf)
|
|
|
|
|
{
|
|
|
|
|
tree finally, new_stmt;
|
|
|
|
|
tree x;
|
|
|
|
|
|
|
|
|
|
finally = TREE_OPERAND (*tf->top_p, 1);
|
|
|
|
|
*tf->top_p = TREE_OPERAND (*tf->top_p, 0);
|
|
|
|
|
|
|
|
|
|
new_stmt = NULL_TREE;
|
|
|
|
|
|
|
|
|
|
if (tf->may_fallthru)
|
|
|
|
|
{
|
|
|
|
|
x = lower_try_finally_dup_block (finally, state);
|
|
|
|
|
lower_eh_constructs_1 (state, &x);
|
|
|
|
|
append_to_statement_list (x, &new_stmt);
|
|
|
|
|
|
|
|
|
|
x = lower_try_finally_fallthru_label (tf);
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, x);
|
|
|
|
|
append_to_statement_list (x, &new_stmt);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (tf->may_throw)
|
|
|
|
|
{
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, tf->eh_label);
|
|
|
|
|
append_to_statement_list (x, &new_stmt);
|
|
|
|
|
|
|
|
|
|
x = lower_try_finally_dup_block (finally, state);
|
|
|
|
|
lower_eh_constructs_1 (state, &x);
|
|
|
|
|
append_to_statement_list (x, &new_stmt);
|
|
|
|
|
|
2005-05-11 18:25:30 +02:00
|
|
|
|
x = build_resx (get_eh_region_number (tf->region));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (x, &new_stmt);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (tf->goto_queue)
|
|
|
|
|
{
|
|
|
|
|
struct goto_queue_node *q, *qe;
|
|
|
|
|
tree return_val = NULL;
|
2005-04-14 20:44:09 +02:00
|
|
|
|
int return_index, index;
|
2005-12-18 02:19:20 +01:00
|
|
|
|
struct labels_s
|
2005-04-14 20:44:09 +02:00
|
|
|
|
{
|
|
|
|
|
struct goto_queue_node *q;
|
|
|
|
|
tree label;
|
|
|
|
|
} *labels;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
2005-05-14 05:25:44 +02:00
|
|
|
|
return_index = VEC_length (tree, tf->dest_array);
|
2005-12-18 02:19:20 +01:00
|
|
|
|
labels = XCNEWVEC (struct labels_s, return_index + 1);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
q = tf->goto_queue;
|
|
|
|
|
qe = q + tf->goto_queue_active;
|
|
|
|
|
for (; q < qe; q++)
|
|
|
|
|
{
|
2005-04-14 20:44:09 +02:00
|
|
|
|
index = q->index < 0 ? return_index : q->index;
|
|
|
|
|
|
|
|
|
|
if (!labels[index].q)
|
|
|
|
|
labels[index].q = q;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (index = 0; index < return_index + 1; index++)
|
|
|
|
|
{
|
|
|
|
|
tree lab;
|
|
|
|
|
|
|
|
|
|
q = labels[index].q;
|
|
|
|
|
if (! q)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
lab = labels[index].label = create_artificial_label ();
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
if (index == return_index)
|
|
|
|
|
do_return_redirection (q, lab, NULL, &return_val);
|
|
|
|
|
else
|
|
|
|
|
do_goto_redirection (q, lab, NULL);
|
|
|
|
|
|
2005-04-14 20:44:09 +02:00
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, lab);
|
|
|
|
|
append_to_statement_list (x, &new_stmt);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
2005-04-14 20:44:09 +02:00
|
|
|
|
x = lower_try_finally_dup_block (finally, state);
|
|
|
|
|
lower_eh_constructs_1 (state, &x);
|
|
|
|
|
append_to_statement_list (x, &new_stmt);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
2005-04-14 20:44:09 +02:00
|
|
|
|
append_to_statement_list (q->cont_stmt, &new_stmt);
|
|
|
|
|
maybe_record_in_goto_queue (state, q->cont_stmt);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
2005-04-14 20:44:09 +02:00
|
|
|
|
|
|
|
|
|
for (q = tf->goto_queue; q < qe; q++)
|
|
|
|
|
{
|
|
|
|
|
tree lab;
|
|
|
|
|
|
|
|
|
|
index = q->index < 0 ? return_index : q->index;
|
|
|
|
|
|
|
|
|
|
if (labels[index].q == q)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
lab = labels[index].label;
|
|
|
|
|
|
|
|
|
|
if (index == return_index)
|
|
|
|
|
do_return_redirection (q, lab, NULL, &return_val);
|
|
|
|
|
else
|
|
|
|
|
do_goto_redirection (q, lab, NULL);
|
|
|
|
|
}
|
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
replace_goto_queue (tf);
|
|
|
|
|
free (labels);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Need to link new stmts after running replace_goto_queue due
|
|
|
|
|
to not wanting to process the same goto stmts twice. */
|
|
|
|
|
append_to_statement_list (new_stmt, tf->top_p);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_try_finally. There are multiple edges incoming
|
|
|
|
|
and outgoing from the finally block. Implement this by instrumenting
|
|
|
|
|
each incoming edge and creating a switch statement at the end of the
|
|
|
|
|
finally block that branches to the appropriate destination. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_try_finally_switch (struct leh_state *state, struct leh_tf_state *tf)
|
|
|
|
|
{
|
|
|
|
|
struct goto_queue_node *q, *qe;
|
|
|
|
|
tree return_val = NULL;
|
|
|
|
|
tree finally, finally_tmp, finally_label;
|
|
|
|
|
int return_index, eh_index, fallthru_index;
|
|
|
|
|
int nlabels, ndests, j, last_case_index;
|
|
|
|
|
tree case_label_vec, switch_stmt, last_case, switch_body;
|
|
|
|
|
tree x;
|
|
|
|
|
|
|
|
|
|
/* Mash the TRY block to the head of the chain. */
|
|
|
|
|
finally = TREE_OPERAND (*tf->top_p, 1);
|
|
|
|
|
*tf->top_p = TREE_OPERAND (*tf->top_p, 0);
|
|
|
|
|
|
|
|
|
|
/* Lower the finally block itself. */
|
|
|
|
|
lower_eh_constructs_1 (state, &finally);
|
|
|
|
|
|
|
|
|
|
/* Prepare for switch statement generation. */
|
2005-05-14 05:25:44 +02:00
|
|
|
|
nlabels = VEC_length (tree, tf->dest_array);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
return_index = nlabels;
|
|
|
|
|
eh_index = return_index + tf->may_return;
|
|
|
|
|
fallthru_index = eh_index + tf->may_throw;
|
|
|
|
|
ndests = fallthru_index + tf->may_fallthru;
|
|
|
|
|
|
|
|
|
|
finally_tmp = create_tmp_var (integer_type_node, "finally_tmp");
|
|
|
|
|
finally_label = create_artificial_label ();
|
|
|
|
|
|
|
|
|
|
case_label_vec = make_tree_vec (ndests);
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
switch_stmt = build3 (SWITCH_EXPR, integer_type_node, finally_tmp,
|
|
|
|
|
NULL_TREE, case_label_vec);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
switch_body = NULL;
|
|
|
|
|
last_case = NULL;
|
|
|
|
|
last_case_index = 0;
|
|
|
|
|
|
|
|
|
|
/* Begin inserting code for getting to the finally block. Things
|
|
|
|
|
are done in this order to correspond to the sequence the code is
|
|
|
|
|
layed out. */
|
|
|
|
|
|
|
|
|
|
if (tf->may_fallthru)
|
|
|
|
|
{
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, void_type_node, finally_tmp,
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
build_int_cst (NULL_TREE, fallthru_index));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
|
|
|
|
if (tf->may_throw)
|
|
|
|
|
{
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, finally_label);
|
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
last_case = build3 (CASE_LABEL_EXPR, void_type_node,
|
|
|
|
|
build_int_cst (NULL_TREE, fallthru_index), NULL,
|
|
|
|
|
create_artificial_label ());
|
2004-05-13 08:41:07 +02:00
|
|
|
|
TREE_VEC_ELT (case_label_vec, last_case_index) = last_case;
|
|
|
|
|
last_case_index++;
|
|
|
|
|
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (last_case));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (x, &switch_body);
|
|
|
|
|
|
|
|
|
|
x = lower_try_finally_fallthru_label (tf);
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, x);
|
|
|
|
|
append_to_statement_list (x, &switch_body);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (tf->may_throw)
|
|
|
|
|
{
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, tf->eh_label);
|
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
2006-12-05 18:26:05 +01:00
|
|
|
|
x = build2 (GIMPLE_MODIFY_STMT, void_type_node, finally_tmp,
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
build_int_cst (NULL_TREE, eh_index));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
last_case = build3 (CASE_LABEL_EXPR, void_type_node,
|
|
|
|
|
build_int_cst (NULL_TREE, eh_index), NULL,
|
|
|
|
|
create_artificial_label ());
|
2004-05-13 08:41:07 +02:00
|
|
|
|
TREE_VEC_ELT (case_label_vec, last_case_index) = last_case;
|
|
|
|
|
last_case_index++;
|
|
|
|
|
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (last_case));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (x, &switch_body);
|
2005-05-11 18:25:30 +02:00
|
|
|
|
x = build_resx (get_eh_region_number (tf->region));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
append_to_statement_list (x, &switch_body);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, finally_label);
|
|
|
|
|
append_to_statement_list (x, tf->top_p);
|
|
|
|
|
|
|
|
|
|
append_to_statement_list (finally, tf->top_p);
|
|
|
|
|
|
|
|
|
|
/* Redirect each incoming goto edge. */
|
|
|
|
|
q = tf->goto_queue;
|
|
|
|
|
qe = q + tf->goto_queue_active;
|
|
|
|
|
j = last_case_index + tf->may_return;
|
|
|
|
|
for (; q < qe; ++q)
|
|
|
|
|
{
|
|
|
|
|
tree mod;
|
|
|
|
|
int switch_id, case_index;
|
|
|
|
|
|
|
|
|
|
if (q->index < 0)
|
|
|
|
|
{
|
2006-12-05 18:26:05 +01:00
|
|
|
|
mod = build2 (GIMPLE_MODIFY_STMT, void_type_node, finally_tmp,
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
build_int_cst (NULL_TREE, return_index));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
do_return_redirection (q, finally_label, mod, &return_val);
|
|
|
|
|
switch_id = return_index;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2006-12-05 18:26:05 +01:00
|
|
|
|
mod = build2 (GIMPLE_MODIFY_STMT, void_type_node, finally_tmp,
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
build_int_cst (NULL_TREE, q->index));
|
2004-05-13 08:41:07 +02:00
|
|
|
|
do_goto_redirection (q, finally_label, mod);
|
|
|
|
|
switch_id = q->index;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
case_index = j + q->index;
|
|
|
|
|
if (!TREE_VEC_ELT (case_label_vec, case_index))
|
2005-04-14 20:44:09 +02:00
|
|
|
|
TREE_VEC_ELT (case_label_vec, case_index)
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
= build3 (CASE_LABEL_EXPR, void_type_node,
|
|
|
|
|
build_int_cst (NULL_TREE, switch_id), NULL,
|
|
|
|
|
/* We store the cont_stmt in the
|
|
|
|
|
CASE_LABEL, so that we can recover it
|
|
|
|
|
in the loop below. We don't create
|
|
|
|
|
the new label while walking the
|
|
|
|
|
goto_queue because pointers don't
|
|
|
|
|
offer a stable order. */
|
|
|
|
|
q->cont_stmt);
|
2005-04-14 20:44:09 +02:00
|
|
|
|
}
|
|
|
|
|
for (j = last_case_index; j < last_case_index + nlabels; j++)
|
|
|
|
|
{
|
|
|
|
|
tree label;
|
|
|
|
|
tree cont_stmt;
|
|
|
|
|
|
|
|
|
|
last_case = TREE_VEC_ELT (case_label_vec, j);
|
|
|
|
|
|
|
|
|
|
gcc_assert (last_case);
|
|
|
|
|
|
|
|
|
|
cont_stmt = CASE_LABEL (last_case);
|
|
|
|
|
|
|
|
|
|
label = create_artificial_label ();
|
|
|
|
|
CASE_LABEL (last_case) = label;
|
|
|
|
|
|
tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-ssa-loop-im.c (schedule_sm): Use buildN instead of build.
* tree-complex.c (update_complex_assignment, expand_complex_div_wide):
Likewise.
* tree-ssa-ccp.c (maybe_fold_offset_to_array_ref,
maybe_fold_offset_to_component_ref): Likewise.
* tree-ssa-dom.c (thread_across_edge,
simplify_rhs_and_lookup_avail_expr,
find_equivalent_equality_comparison, record_equivalences_from_stmt):
Likewise.
* gimple-low.c (lower_function_body, lower_return_expr): Likewise.
* tree-eh.c (do_return_redirection, honor_protect_cleanup_actions,
lower_try_finally_switch): Likewise.
* tree-if-conv.c (add_to_dst_predicate_list,
replace_phi_with_cond_modify_expr, ifc_temp_var): Likewise.
* gimplify.c (internal_get_tmp_var, gimple_build_eh_filter,
voidify_wrapper_expr, build_stack_save_restore, gimplify_bind_expr,
gimplify_return_expr, gimplify_decl_expr, gimplify_switch_expr,
gimplify_case_label_expr, gimplify_exit_expr, gimplify_self_mod_expr,
shortcut_cond_r, shortcut_cond_expr, gimplify_cond_expr,
gimplify_init_ctor_eval, gimplify_init_constructor,
gimplify_variable_sized_compare, gimplify_boolean_expr,
gimplify_cleanup_point_expr, gimple_push_cleanup, gimplify_target_expr,
gimplify_expr, gimplify_body, gimplify_function_tree,
force_gimple_operand): Likewise.
* tree-ssa-pre.c (create_expression_by_pieces): Likewise.
* tree-mudflap.c (mf_decl_cache_locals, mf_build_check_statement_for,
mx_register_decls): Likewise.
* tree-nested.c (init_tmp_var, save_tmp_var, get_static_chain,
get_frame_field, finalize_nesting_tree_1): Likewise.
* tree-inline.c (setup_one_parameter): Likewise.
* tree-vect-transform.c (vectorizable_condition): Likewise.
* tree-outof-ssa.c (insert_copy_on_edge, insert_backedge_copies):
Likewise.
* tree-profile.c (tree_gen_edge_profiler): Likewise.
* tree-cfg.c (factor_computed_gotos, gimplify_val): Likewise.
* c-parser.c (c_parser_if_body, c_parser_switch_statement): Likewise.
* tree-chrec.h (build_polynomial_chrec): Likewise.
From-SVN: r107907
2005-12-02 18:09:40 +01:00
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, label);
|
2005-04-14 20:44:09 +02:00
|
|
|
|
append_to_statement_list (x, &switch_body);
|
|
|
|
|
append_to_statement_list (cont_stmt, &switch_body);
|
|
|
|
|
maybe_record_in_goto_queue (state, cont_stmt);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
replace_goto_queue (tf);
|
|
|
|
|
|
2004-05-30 20:19:18 +02:00
|
|
|
|
/* Make sure that the last case is the default label, as one is required.
|
|
|
|
|
Then sort the labels, which is also required in GIMPLE. */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
CASE_LOW (last_case) = NULL;
|
2004-05-30 20:19:18 +02:00
|
|
|
|
sort_case_labels (case_label_vec);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
/* Need to link switch_stmt after running replace_goto_queue due
|
|
|
|
|
to not wanting to process the same goto stmts twice. */
|
|
|
|
|
append_to_statement_list (switch_stmt, tf->top_p);
|
|
|
|
|
append_to_statement_list (switch_body, tf->top_p);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Decide whether or not we are going to duplicate the finally block.
|
|
|
|
|
There are several considerations.
|
|
|
|
|
|
|
|
|
|
First, if this is Java, then the finally block contains code
|
|
|
|
|
written by the user. It has line numbers associated with it,
|
|
|
|
|
so duplicating the block means it's difficult to set a breakpoint.
|
|
|
|
|
Since controlling code generation via -g is verboten, we simply
|
|
|
|
|
never duplicate code without optimization.
|
|
|
|
|
|
|
|
|
|
Second, we'd like to prevent egregious code growth. One way to
|
|
|
|
|
do this is to estimate the size of the finally block, multiply
|
|
|
|
|
that by the number of copies we'd need to make, and compare against
|
|
|
|
|
the estimate of the size of the switch machinery we'd have to add. */
|
|
|
|
|
|
|
|
|
|
static bool
|
|
|
|
|
decide_copy_try_finally (int ndests, tree finally)
|
|
|
|
|
{
|
|
|
|
|
int f_estimate, sw_estimate;
|
|
|
|
|
|
|
|
|
|
if (!optimize)
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
/* Finally estimate N times, plus N gotos. */
|
2007-01-28 18:40:38 +01:00
|
|
|
|
f_estimate = estimate_num_insns (finally, &eni_size_weights);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
f_estimate = (f_estimate + 1) * ndests;
|
|
|
|
|
|
|
|
|
|
/* Switch statement (cost 10), N variable assignments, N gotos. */
|
|
|
|
|
sw_estimate = 10 + 2 * ndests;
|
|
|
|
|
|
|
|
|
|
/* Optimize for size clearly wants our best guess. */
|
|
|
|
|
if (optimize_size)
|
|
|
|
|
return f_estimate < sw_estimate;
|
|
|
|
|
|
|
|
|
|
/* ??? These numbers are completely made up so far. */
|
|
|
|
|
if (optimize > 1)
|
2004-06-19 00:32:49 +02:00
|
|
|
|
return f_estimate < 100 || f_estimate < sw_estimate * 2;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
else
|
2004-06-19 00:32:49 +02:00
|
|
|
|
return f_estimate < 40 || f_estimate * 2 < sw_estimate * 3;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_eh_constructs_1. Lower a TRY_FINALLY_EXPR nodes
|
|
|
|
|
to a sequence of labels and blocks, plus the exception region trees
|
2004-08-19 23:34:37 +02:00
|
|
|
|
that record all the magic. This is complicated by the need to
|
2004-05-13 08:41:07 +02:00
|
|
|
|
arrange for the FINALLY block to be executed on all exits. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_try_finally (struct leh_state *state, tree *tp)
|
|
|
|
|
{
|
|
|
|
|
struct leh_tf_state this_tf;
|
|
|
|
|
struct leh_state this_state;
|
|
|
|
|
int ndests;
|
|
|
|
|
|
|
|
|
|
/* Process the try block. */
|
|
|
|
|
|
|
|
|
|
memset (&this_tf, 0, sizeof (this_tf));
|
|
|
|
|
this_tf.try_finally_expr = *tp;
|
|
|
|
|
this_tf.top_p = tp;
|
|
|
|
|
this_tf.outer = state;
|
|
|
|
|
if (using_eh_for_cleanups_p)
|
|
|
|
|
this_tf.region
|
|
|
|
|
= gen_eh_region_cleanup (state->cur_region, state->prev_try);
|
|
|
|
|
else
|
|
|
|
|
this_tf.region = NULL;
|
|
|
|
|
|
|
|
|
|
this_state.cur_region = this_tf.region;
|
|
|
|
|
this_state.prev_try = state->prev_try;
|
|
|
|
|
this_state.tf = &this_tf;
|
|
|
|
|
|
|
|
|
|
lower_eh_constructs_1 (&this_state, &TREE_OPERAND (*tp, 0));
|
|
|
|
|
|
|
|
|
|
/* Determine if the try block is escaped through the bottom. */
|
|
|
|
|
this_tf.may_fallthru = block_may_fallthru (TREE_OPERAND (*tp, 0));
|
|
|
|
|
|
|
|
|
|
/* Determine if any exceptions are possible within the try block. */
|
|
|
|
|
if (using_eh_for_cleanups_p)
|
|
|
|
|
this_tf.may_throw = get_eh_region_may_contain_throw (this_tf.region);
|
|
|
|
|
if (this_tf.may_throw)
|
|
|
|
|
{
|
|
|
|
|
this_tf.eh_label = create_artificial_label ();
|
|
|
|
|
set_eh_region_tree_label (this_tf.region, this_tf.eh_label);
|
|
|
|
|
honor_protect_cleanup_actions (state, &this_state, &this_tf);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Sort the goto queue for efficient searching later. */
|
|
|
|
|
if (this_tf.goto_queue_active > 1)
|
|
|
|
|
qsort (this_tf.goto_queue, this_tf.goto_queue_active,
|
|
|
|
|
sizeof (struct goto_queue_node), goto_queue_cmp);
|
|
|
|
|
|
|
|
|
|
/* Determine how many edges (still) reach the finally block. Or rather,
|
|
|
|
|
how many destinations are reached by the finally block. Use this to
|
|
|
|
|
determine how we process the finally block itself. */
|
|
|
|
|
|
2005-05-14 05:25:44 +02:00
|
|
|
|
ndests = VEC_length (tree, this_tf.dest_array);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
ndests += this_tf.may_fallthru;
|
|
|
|
|
ndests += this_tf.may_return;
|
|
|
|
|
ndests += this_tf.may_throw;
|
|
|
|
|
|
|
|
|
|
/* If the FINALLY block is not reachable, dike it out. */
|
|
|
|
|
if (ndests == 0)
|
|
|
|
|
*tp = TREE_OPERAND (*tp, 0);
|
|
|
|
|
|
|
|
|
|
/* If the finally block doesn't fall through, then any destination
|
|
|
|
|
we might try to impose there isn't reached either. There may be
|
|
|
|
|
some minor amount of cleanup and redirection still needed. */
|
|
|
|
|
else if (!block_may_fallthru (TREE_OPERAND (*tp, 1)))
|
|
|
|
|
lower_try_finally_nofallthru (state, &this_tf);
|
|
|
|
|
|
|
|
|
|
/* We can easily special-case redirection to a single destination. */
|
|
|
|
|
else if (ndests == 1)
|
|
|
|
|
lower_try_finally_onedest (state, &this_tf);
|
|
|
|
|
|
|
|
|
|
else if (decide_copy_try_finally (ndests, TREE_OPERAND (*tp, 1)))
|
|
|
|
|
lower_try_finally_copy (state, &this_tf);
|
|
|
|
|
else
|
|
|
|
|
lower_try_finally_switch (state, &this_tf);
|
|
|
|
|
|
|
|
|
|
/* If someone requested we add a label at the end of the transformed
|
|
|
|
|
block, do so. */
|
|
|
|
|
if (this_tf.fallthru_label)
|
|
|
|
|
{
|
|
|
|
|
tree x = build1 (LABEL_EXPR, void_type_node, this_tf.fallthru_label);
|
|
|
|
|
append_to_statement_list (x, tp);
|
|
|
|
|
}
|
|
|
|
|
|
2005-05-14 05:25:44 +02:00
|
|
|
|
VEC_free (tree, heap, this_tf.dest_array);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (this_tf.goto_queue)
|
|
|
|
|
free (this_tf.goto_queue);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_eh_constructs_1. Lower a TRY_CATCH_EXPR with a
|
2004-08-19 23:34:37 +02:00
|
|
|
|
list of CATCH_EXPR nodes to a sequence of labels and blocks, plus the
|
2004-05-13 08:41:07 +02:00
|
|
|
|
exception region trees that record all the magic. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_catch (struct leh_state *state, tree *tp)
|
|
|
|
|
{
|
|
|
|
|
struct eh_region *try_region;
|
|
|
|
|
struct leh_state this_state;
|
|
|
|
|
tree_stmt_iterator i;
|
|
|
|
|
tree out_label;
|
|
|
|
|
|
|
|
|
|
try_region = gen_eh_region_try (state->cur_region);
|
|
|
|
|
this_state.cur_region = try_region;
|
|
|
|
|
this_state.prev_try = try_region;
|
|
|
|
|
this_state.tf = state->tf;
|
|
|
|
|
|
|
|
|
|
lower_eh_constructs_1 (&this_state, &TREE_OPERAND (*tp, 0));
|
|
|
|
|
|
|
|
|
|
if (!get_eh_region_may_contain_throw (try_region))
|
|
|
|
|
{
|
|
|
|
|
*tp = TREE_OPERAND (*tp, 0);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
out_label = NULL;
|
|
|
|
|
for (i = tsi_start (TREE_OPERAND (*tp, 1)); !tsi_end_p (i); )
|
|
|
|
|
{
|
|
|
|
|
struct eh_region *catch_region;
|
|
|
|
|
tree catch, x, eh_label;
|
|
|
|
|
|
|
|
|
|
catch = tsi_stmt (i);
|
|
|
|
|
catch_region = gen_eh_region_catch (try_region, CATCH_TYPES (catch));
|
|
|
|
|
|
|
|
|
|
this_state.cur_region = catch_region;
|
|
|
|
|
this_state.prev_try = state->prev_try;
|
|
|
|
|
lower_eh_constructs_1 (&this_state, &CATCH_BODY (catch));
|
|
|
|
|
|
|
|
|
|
eh_label = create_artificial_label ();
|
|
|
|
|
set_eh_region_tree_label (catch_region, eh_label);
|
|
|
|
|
|
|
|
|
|
x = build1 (LABEL_EXPR, void_type_node, eh_label);
|
|
|
|
|
tsi_link_before (&i, x, TSI_SAME_STMT);
|
|
|
|
|
|
|
|
|
|
if (block_may_fallthru (CATCH_BODY (catch)))
|
|
|
|
|
{
|
|
|
|
|
if (!out_label)
|
|
|
|
|
out_label = create_artificial_label ();
|
|
|
|
|
|
|
|
|
|
x = build1 (GOTO_EXPR, void_type_node, out_label);
|
|
|
|
|
append_to_statement_list (x, &CATCH_BODY (catch));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
tsi_link_before (&i, CATCH_BODY (catch), TSI_SAME_STMT);
|
|
|
|
|
tsi_delink (&i);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
frob_into_branch_around (tp, NULL, out_label);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A subroutine of lower_eh_constructs_1. Lower a TRY_CATCH_EXPR with a
|
|
|
|
|
EH_FILTER_EXPR to a sequence of labels and blocks, plus the exception
|
|
|
|
|
region trees that record all the magic. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_eh_filter (struct leh_state *state, tree *tp)
|
|
|
|
|
{
|
|
|
|
|
struct leh_state this_state;
|
|
|
|
|
struct eh_region *this_region;
|
|
|
|
|
tree inner = expr_first (TREE_OPERAND (*tp, 1));
|
|
|
|
|
tree eh_label;
|
2004-08-19 23:34:37 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (EH_FILTER_MUST_NOT_THROW (inner))
|
|
|
|
|
this_region = gen_eh_region_must_not_throw (state->cur_region);
|
|
|
|
|
else
|
|
|
|
|
this_region = gen_eh_region_allowed (state->cur_region,
|
|
|
|
|
EH_FILTER_TYPES (inner));
|
|
|
|
|
this_state = *state;
|
|
|
|
|
this_state.cur_region = this_region;
|
2004-08-19 23:34:37 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
lower_eh_constructs_1 (&this_state, &TREE_OPERAND (*tp, 0));
|
|
|
|
|
|
|
|
|
|
if (!get_eh_region_may_contain_throw (this_region))
|
|
|
|
|
{
|
|
|
|
|
*tp = TREE_OPERAND (*tp, 0);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
lower_eh_constructs_1 (state, &EH_FILTER_FAILURE (inner));
|
|
|
|
|
TREE_OPERAND (*tp, 1) = EH_FILTER_FAILURE (inner);
|
|
|
|
|
|
|
|
|
|
eh_label = create_artificial_label ();
|
|
|
|
|
set_eh_region_tree_label (this_region, eh_label);
|
|
|
|
|
|
|
|
|
|
frob_into_branch_around (tp, eh_label, NULL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Implement a cleanup expression. This is similar to try-finally,
|
|
|
|
|
except that we only execute the cleanup block for exception edges. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_cleanup (struct leh_state *state, tree *tp)
|
|
|
|
|
{
|
|
|
|
|
struct leh_state this_state;
|
|
|
|
|
struct eh_region *this_region;
|
|
|
|
|
struct leh_tf_state fake_tf;
|
|
|
|
|
|
|
|
|
|
/* If not using eh, then exception-only cleanups are no-ops. */
|
|
|
|
|
if (!flag_exceptions)
|
|
|
|
|
{
|
|
|
|
|
*tp = TREE_OPERAND (*tp, 0);
|
|
|
|
|
lower_eh_constructs_1 (state, tp);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
this_region = gen_eh_region_cleanup (state->cur_region, state->prev_try);
|
|
|
|
|
this_state = *state;
|
|
|
|
|
this_state.cur_region = this_region;
|
|
|
|
|
|
|
|
|
|
lower_eh_constructs_1 (&this_state, &TREE_OPERAND (*tp, 0));
|
|
|
|
|
|
|
|
|
|
if (!get_eh_region_may_contain_throw (this_region))
|
|
|
|
|
{
|
|
|
|
|
*tp = TREE_OPERAND (*tp, 0);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Build enough of a try-finally state so that we can reuse
|
|
|
|
|
honor_protect_cleanup_actions. */
|
|
|
|
|
memset (&fake_tf, 0, sizeof (fake_tf));
|
|
|
|
|
fake_tf.top_p = tp;
|
|
|
|
|
fake_tf.outer = state;
|
|
|
|
|
fake_tf.region = this_region;
|
|
|
|
|
fake_tf.may_fallthru = block_may_fallthru (TREE_OPERAND (*tp, 0));
|
|
|
|
|
fake_tf.may_throw = true;
|
|
|
|
|
|
|
|
|
|
fake_tf.eh_label = create_artificial_label ();
|
|
|
|
|
set_eh_region_tree_label (this_region, fake_tf.eh_label);
|
|
|
|
|
|
|
|
|
|
honor_protect_cleanup_actions (state, NULL, &fake_tf);
|
|
|
|
|
|
|
|
|
|
if (fake_tf.may_throw)
|
|
|
|
|
{
|
|
|
|
|
/* In this case honor_protect_cleanup_actions had nothing to do,
|
|
|
|
|
and we should process this normally. */
|
|
|
|
|
lower_eh_constructs_1 (state, &TREE_OPERAND (*tp, 1));
|
|
|
|
|
frob_into_branch_around (tp, fake_tf.eh_label, fake_tf.fallthru_label);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* In this case honor_protect_cleanup_actions did nearly all of
|
|
|
|
|
the work. All we have left is to append the fallthru_label. */
|
|
|
|
|
|
|
|
|
|
*tp = TREE_OPERAND (*tp, 0);
|
|
|
|
|
if (fake_tf.fallthru_label)
|
|
|
|
|
{
|
|
|
|
|
tree x = build1 (LABEL_EXPR, void_type_node, fake_tf.fallthru_label);
|
|
|
|
|
append_to_statement_list (x, tp);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Main loop for lowering eh constructs. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
lower_eh_constructs_1 (struct leh_state *state, tree *tp)
|
|
|
|
|
{
|
|
|
|
|
tree_stmt_iterator i;
|
|
|
|
|
tree t = *tp;
|
|
|
|
|
|
|
|
|
|
switch (TREE_CODE (t))
|
|
|
|
|
{
|
|
|
|
|
case COND_EXPR:
|
|
|
|
|
lower_eh_constructs_1 (state, &COND_EXPR_THEN (t));
|
|
|
|
|
lower_eh_constructs_1 (state, &COND_EXPR_ELSE (t));
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case CALL_EXPR:
|
|
|
|
|
/* Look for things that can throw exceptions, and record them. */
|
|
|
|
|
if (state->cur_region && tree_could_throw_p (t))
|
|
|
|
|
{
|
|
|
|
|
record_stmt_eh_region (state->cur_region, t);
|
|
|
|
|
note_eh_region_may_contain_throw (state->cur_region);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
2006-12-05 18:26:05 +01:00
|
|
|
|
case GIMPLE_MODIFY_STMT:
|
2004-05-13 08:41:07 +02:00
|
|
|
|
/* Look for things that can throw exceptions, and record them. */
|
|
|
|
|
if (state->cur_region && tree_could_throw_p (t))
|
|
|
|
|
{
|
|
|
|
|
record_stmt_eh_region (state->cur_region, t);
|
|
|
|
|
note_eh_region_may_contain_throw (state->cur_region);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case GOTO_EXPR:
|
|
|
|
|
case RETURN_EXPR:
|
|
|
|
|
maybe_record_in_goto_queue (state, t);
|
|
|
|
|
break;
|
|
|
|
|
case SWITCH_EXPR:
|
|
|
|
|
verify_norecord_switch_expr (state, t);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case TRY_FINALLY_EXPR:
|
|
|
|
|
lower_try_finally (state, tp);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case TRY_CATCH_EXPR:
|
|
|
|
|
i = tsi_start (TREE_OPERAND (t, 1));
|
|
|
|
|
switch (TREE_CODE (tsi_stmt (i)))
|
|
|
|
|
{
|
|
|
|
|
case CATCH_EXPR:
|
|
|
|
|
lower_catch (state, tp);
|
|
|
|
|
break;
|
|
|
|
|
case EH_FILTER_EXPR:
|
|
|
|
|
lower_eh_filter (state, tp);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
lower_cleanup (state, tp);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case STATEMENT_LIST:
|
|
|
|
|
for (i = tsi_start (t); !tsi_end_p (i); )
|
|
|
|
|
{
|
|
|
|
|
lower_eh_constructs_1 (state, tsi_stmt_ptr (i));
|
|
|
|
|
t = tsi_stmt (i);
|
|
|
|
|
if (TREE_CODE (t) == STATEMENT_LIST)
|
|
|
|
|
{
|
|
|
|
|
tsi_link_before (&i, t, TSI_SAME_STMT);
|
|
|
|
|
tsi_delink (&i);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
tsi_next (&i);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
/* A type, a decl, or some kind of statement that we're not
|
|
|
|
|
interested in. Don't walk them. */
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2006-03-02 20:00:11 +01:00
|
|
|
|
static unsigned int
|
2004-05-13 08:41:07 +02:00
|
|
|
|
lower_eh_constructs (void)
|
|
|
|
|
{
|
|
|
|
|
struct leh_state null_state;
|
|
|
|
|
tree *tp = &DECL_SAVED_TREE (current_function_decl);
|
|
|
|
|
|
|
|
|
|
finally_tree = htab_create (31, struct_ptr_hash, struct_ptr_eq, free);
|
|
|
|
|
|
|
|
|
|
collect_finally_tree (*tp, NULL);
|
|
|
|
|
|
|
|
|
|
memset (&null_state, 0, sizeof (null_state));
|
|
|
|
|
lower_eh_constructs_1 (&null_state, tp);
|
|
|
|
|
|
|
|
|
|
htab_delete (finally_tree);
|
|
|
|
|
|
|
|
|
|
collect_eh_region_array ();
|
2006-03-02 20:00:11 +01:00
|
|
|
|
return 0;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
2004-08-19 23:34:37 +02:00
|
|
|
|
struct tree_opt_pass pass_lower_eh =
|
2004-05-13 08:41:07 +02:00
|
|
|
|
{
|
|
|
|
|
"eh", /* name */
|
|
|
|
|
NULL, /* gate */
|
|
|
|
|
lower_eh_constructs, /* execute */
|
|
|
|
|
NULL, /* sub */
|
|
|
|
|
NULL, /* next */
|
|
|
|
|
0, /* static_pass_number */
|
|
|
|
|
TV_TREE_EH, /* tv_id */
|
|
|
|
|
PROP_gimple_lcf, /* properties_required */
|
|
|
|
|
PROP_gimple_leh, /* properties_provided */
|
2006-02-08 09:13:20 +01:00
|
|
|
|
0, /* properties_destroyed */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
0, /* todo_flags_start */
|
Unify the management of RTL and tree-level dump files.
2004-09-06 Paolo Bonzini <bonzini@gnu.org>
Unify the management of RTL and tree-level dump files.
* cfgexpand.c (tree_expand_cfg): Fix incorrect comment.
Don't print function name to the dump file, the pass manager
would do this for us. Add code from the top of
rest_of_compilation, up to the initial RTL dump.
* passes.c (rest_of_handle_jump): Call fixup_tail_calls and
close the DFI_sibling dump file.
(rest_of_compilation): Don't do that here. Remove code up to the
initial RTL dump.
(init_optimization_passes): Remove.
(pass_rest_of_compilation): Change pass name to NULL.
* toplev.c (lang_dependent_init): Do not use an empty dump file prefix.
Do not call init_optimization_passes.
* toplev.h (init_optimization_passes): Remove.
* graph.c (print_rtl_graph_with_bb, clean_graph_dump_file,
finish_graph_dump_file): Remove SUFFIX parameter.
* graph.h (print_rtl_graph_with_bb, clean_graph_dump_file,
finish_graph_dump_file): Likewise.
* tree-pass.h (struct tree_opt_pass): Add `letter' field.
* cfgexpand.c (pass_expand): Adjust.
* gimple-low.c (pass_lower_cf, pass_remove_useless_vars): Adjust.
* passes.c (pass_rest_of_compilation): Adjust.
* predict.c (pass_profile): Adjust.
* tree-alias-common.c (pass_build_pta, pass_del_pta): Adjust.
* tree-cfg.c (pass_build_cfg, pass_remove_useless_stmts,
pass_split_crit_edges, pass_warn_function_return): Adjust.
* tree-complex.c (pass_lower_vector_ssa, pass_pre_expand): Adjust.
* tree-dfa.c (pass_referenced_vars): Adjust.
* tree-eh.c (pass_lower_eh): Adjust.
* tree-if-conv.c (pass_build_ssa): Adjust.
* tree-into-ssa.c (pass_build_ssa): Adjust.
* tree-mudflap.c (pass_mudflap_1, pass_mudflap_2): Adjust.
* tree-nomudflap.c (pass_mudflap_1, pass_mudflap_2): Adjust.
* tree-nrv.c (pass_nrv): Adjust.
* tree-optimize.c (pass_gimple, pass_all_optimizations,
pass_cleanup_cfg_post_optimizing, pass_free_datastructures,
pass_init_datastructures): Adjust.
* tree-outof-ssa.c (pass_del_ssa): Adjust.
* tree-profile.c (pass_tree_profile): Adjust.
* tree-sra.c (pass_sra): Adjust.
* tree-ssa-alias.c (pass_may_alias): Adjust.
* tree-ssa-ccp.c (pass_ccp, pass_fold_builtins): Adjust.
* tree-ssa-copyrename.c (pass_rename_ssa_copies): Adjust.
* tree-ssa-dce.c (pass_dce, pass_cd_dce): Adjust.
* tree-ssa-dom.c (pass_dominator): Adjust.
* tree-ssa-dse.c (pass_dse): Adjust.
* tree-ssa-forwprop.c (pass_forwprop): Adjust.
* tree-ssa-if-conv.c (pass_if_conversion): Adjust.
* tree-ssa-loop-ch.c (pass_ch): Adjust.
* tree-ssa-loop.c (pass_loop, pass_loop_init, pass_lim,
pass_loop_done, pass_complete_unroll, pass_iv_canon,
pass_iv_optimize, pass_vectorize): Adjust.
* tree-ssa-phiopt.c (pass_phiopt): Adjust.
* tree-ssa-pre.c (pass_pre, pass_fre): Adjust.
* tree-ssa.c (pass_redundant_phi, pass_early_warn_uninitialized,
pass_late_warn_uninnitialized): Adjust.
* tree-tailcall.c (pass_tail_recursion, pass_tail_calls): Adjust.
* Makefile.in (tree-dump.o): Add new dependencies.
* cgraph.c (cgraph_remove_node): TDF_all -> TDF_tree_all.
* cgraphunit.c (cgraph_preserve_function_body_p, cgraph_optimize):
Likewise.
* toplev.c (dump_file_name): New.
* tree-dump.c (dump_enable_all): Add LETTER parameter.
(struct dump_file_info): Add NUM and LETTER fields.
(dump_files): Adjust and add RTL dump files.
(dump_register): Add NUM and LETTER fields.
(get_dump_file_name, dump_initialized_p, enable_rtl_dump_file): New.
(dump_begin): Use get_dump_file_name.
(dump_switch_p_1): Adjust call to dump_enable_all.
* tree-dump.h (dump_register): Adjust prototype.
* tree-optimize.c (register_one_dump_file): Take dump file index.
Support flags for RTL dumps.
(register_dump_files): Fill in NUM field of struct dump_file_info.
Track properties both when the gate is executed and when it is not.
(execute_todo): Dump RTL. Add PROPERTIES parameter.
(execute_one_pass): Pass properties to execute_todo. Handle VCG
dumps of RTL.
* tree-pass.h (dump_file_name): New.
* tree.h (TDF_TREE, TDF_RTL, get_dump_file_name, dump_initialized_p):
New.
* Makefile.in (passes.o): Add new dependencies.
* passes.c (struct dump_file_info, enum dump_file_index,
dump_file_tbl, init_optimization_passes): Remove.
(open_dump_file, close_dump_file): Use tree-dumping infrastructure.
(rest_of_handle_new_regalloc, rest_of_handle_old_regalloc): Use
dump_enabled_p.
(finish_optimization_passes): Update finish_graph_dump_file loop.
(enable_rtl_dump_file): Remove.
* tree-dump.c (dump_files): Adjust and add RTL dump files.
(enable_rtl_dump_file): Add here.
* tree.h (enum tree_dump_index): Add RTL dump file indices.
* doc/invoke.texi (Debugging options): Document new RTL debugging
options. Update.
From-SVN: r87113
2004-09-06 12:08:17 +02:00
|
|
|
|
TODO_dump_func, /* todo_flags_finish */
|
|
|
|
|
0 /* letter */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Construct EH edges for STMT. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
make_eh_edge (struct eh_region *region, void *data)
|
|
|
|
|
{
|
|
|
|
|
tree stmt, lab;
|
|
|
|
|
basic_block src, dst;
|
|
|
|
|
|
2005-12-18 02:19:20 +01:00
|
|
|
|
stmt = (tree) data;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
lab = get_eh_region_tree_label (region);
|
|
|
|
|
|
|
|
|
|
src = bb_for_stmt (stmt);
|
|
|
|
|
dst = label_to_block (lab);
|
|
|
|
|
|
|
|
|
|
make_edge (src, dst, EDGE_ABNORMAL | EDGE_EH);
|
|
|
|
|
}
|
2004-08-19 23:34:37 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
void
|
|
|
|
|
make_eh_edges (tree stmt)
|
|
|
|
|
{
|
|
|
|
|
int region_nr;
|
|
|
|
|
bool is_resx;
|
|
|
|
|
|
|
|
|
|
if (TREE_CODE (stmt) == RESX_EXPR)
|
|
|
|
|
{
|
|
|
|
|
region_nr = TREE_INT_CST_LOW (TREE_OPERAND (stmt, 0));
|
|
|
|
|
is_resx = true;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
region_nr = lookup_stmt_eh_region (stmt);
|
|
|
|
|
if (region_nr < 0)
|
|
|
|
|
return;
|
|
|
|
|
is_resx = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
foreach_reachable_handler (region_nr, is_resx, make_eh_edge, stmt);
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-25 19:24:28 +02:00
|
|
|
|
static bool mark_eh_edge_found_error;
|
|
|
|
|
|
|
|
|
|
/* Mark edge make_eh_edge would create for given region by setting it aux
|
|
|
|
|
field, output error if something goes wrong. */
|
|
|
|
|
static void
|
|
|
|
|
mark_eh_edge (struct eh_region *region, void *data)
|
|
|
|
|
{
|
|
|
|
|
tree stmt, lab;
|
|
|
|
|
basic_block src, dst;
|
|
|
|
|
edge e;
|
|
|
|
|
|
2005-12-18 02:19:20 +01:00
|
|
|
|
stmt = (tree) data;
|
2005-04-25 19:24:28 +02:00
|
|
|
|
lab = get_eh_region_tree_label (region);
|
|
|
|
|
|
|
|
|
|
src = bb_for_stmt (stmt);
|
|
|
|
|
dst = label_to_block (lab);
|
|
|
|
|
|
|
|
|
|
e = find_edge (src, dst);
|
|
|
|
|
if (!e)
|
|
|
|
|
{
|
bb-reorder.c, [...]: Avoid "." or "\n" at end of diagnostics and capital letters at start of diagnostics.
* bb-reorder.c, c-pch.c, c-pragma.c, c.opt, cfghooks.c, cfgloop.c,
cfgrtl.c, cgraphunit.c, config/c4x/c4x.c, config/cris/cris.c,
config/frv/frv.c, config/host-darwin.c, config/iq2000/iq2000.c,
config/lynx.h, config/m68k/m68k.c, config/pa/pa.c, config/sh/sh.h,
config/stormy16/stormy16.c, config/v850/v850.c,
config/vax/netbsd-elf.h, coverage.c, dwarf2out.c, emit-rtl.c,
except.c, gcc.c, tree-cfg.c, tree-eh.c, tree-ssa.c, xcoffout.c:
Avoid "." or "\n" at end of diagnostics and capital letters at
start of diagnostics.
* combine.c, cse.c: Don't translate dump file output.
* toplev.c (print_version): Only translate output if going to
stderr.
From-SVN: r101561
2005-07-03 23:08:11 +02:00
|
|
|
|
error ("EH edge %i->%i is missing", src->index, dst->index);
|
2005-04-25 19:24:28 +02:00
|
|
|
|
mark_eh_edge_found_error = true;
|
|
|
|
|
}
|
|
|
|
|
else if (!(e->flags & EDGE_EH))
|
|
|
|
|
{
|
bb-reorder.c, [...]: Avoid "." or "\n" at end of diagnostics and capital letters at start of diagnostics.
* bb-reorder.c, c-pch.c, c-pragma.c, c.opt, cfghooks.c, cfgloop.c,
cfgrtl.c, cgraphunit.c, config/c4x/c4x.c, config/cris/cris.c,
config/frv/frv.c, config/host-darwin.c, config/iq2000/iq2000.c,
config/lynx.h, config/m68k/m68k.c, config/pa/pa.c, config/sh/sh.h,
config/stormy16/stormy16.c, config/v850/v850.c,
config/vax/netbsd-elf.h, coverage.c, dwarf2out.c, emit-rtl.c,
except.c, gcc.c, tree-cfg.c, tree-eh.c, tree-ssa.c, xcoffout.c:
Avoid "." or "\n" at end of diagnostics and capital letters at
start of diagnostics.
* combine.c, cse.c: Don't translate dump file output.
* toplev.c (print_version): Only translate output if going to
stderr.
From-SVN: r101561
2005-07-03 23:08:11 +02:00
|
|
|
|
error ("EH edge %i->%i miss EH flag", src->index, dst->index);
|
2005-04-25 19:24:28 +02:00
|
|
|
|
mark_eh_edge_found_error = true;
|
|
|
|
|
}
|
|
|
|
|
else if (e->aux)
|
|
|
|
|
{
|
|
|
|
|
/* ??? might not be mistake. */
|
bb-reorder.c, [...]: Avoid "." or "\n" at end of diagnostics and capital letters at start of diagnostics.
* bb-reorder.c, c-pch.c, c-pragma.c, c.opt, cfghooks.c, cfgloop.c,
cfgrtl.c, cgraphunit.c, config/c4x/c4x.c, config/cris/cris.c,
config/frv/frv.c, config/host-darwin.c, config/iq2000/iq2000.c,
config/lynx.h, config/m68k/m68k.c, config/pa/pa.c, config/sh/sh.h,
config/stormy16/stormy16.c, config/v850/v850.c,
config/vax/netbsd-elf.h, coverage.c, dwarf2out.c, emit-rtl.c,
except.c, gcc.c, tree-cfg.c, tree-eh.c, tree-ssa.c, xcoffout.c:
Avoid "." or "\n" at end of diagnostics and capital letters at
start of diagnostics.
* combine.c, cse.c: Don't translate dump file output.
* toplev.c (print_version): Only translate output if going to
stderr.
From-SVN: r101561
2005-07-03 23:08:11 +02:00
|
|
|
|
error ("EH edge %i->%i has duplicated regions", src->index, dst->index);
|
2005-04-25 19:24:28 +02:00
|
|
|
|
mark_eh_edge_found_error = true;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
e->aux = (void *)1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Verify that BB containing stmt as last stmt has precisely the edges
|
|
|
|
|
make_eh_edges would create. */
|
|
|
|
|
bool
|
|
|
|
|
verify_eh_edges (tree stmt)
|
|
|
|
|
{
|
|
|
|
|
int region_nr;
|
|
|
|
|
bool is_resx;
|
|
|
|
|
basic_block bb = bb_for_stmt (stmt);
|
|
|
|
|
edge_iterator ei;
|
|
|
|
|
edge e;
|
|
|
|
|
|
|
|
|
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
|
|
|
|
gcc_assert (!e->aux);
|
|
|
|
|
mark_eh_edge_found_error = false;
|
|
|
|
|
if (TREE_CODE (stmt) == RESX_EXPR)
|
|
|
|
|
{
|
|
|
|
|
region_nr = TREE_INT_CST_LOW (TREE_OPERAND (stmt, 0));
|
|
|
|
|
is_resx = true;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
region_nr = lookup_stmt_eh_region (stmt);
|
|
|
|
|
if (region_nr < 0)
|
|
|
|
|
{
|
|
|
|
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
|
|
|
|
if (e->flags & EDGE_EH)
|
|
|
|
|
{
|
|
|
|
|
error ("BB %i can not throw but has EH edges", bb->index);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
if (!tree_could_throw_p (stmt))
|
|
|
|
|
{
|
|
|
|
|
error ("BB %i last statement has incorrectly set region", bb->index);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
is_resx = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
foreach_reachable_handler (region_nr, is_resx, mark_eh_edge, stmt);
|
|
|
|
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
|
|
|
|
{
|
|
|
|
|
if ((e->flags & EDGE_EH) && !e->aux)
|
|
|
|
|
{
|
bb-reorder.c, [...]: Avoid "." or "\n" at end of diagnostics and capital letters at start of diagnostics.
* bb-reorder.c, c-pch.c, c-pragma.c, c.opt, cfghooks.c, cfgloop.c,
cfgrtl.c, cgraphunit.c, config/c4x/c4x.c, config/cris/cris.c,
config/frv/frv.c, config/host-darwin.c, config/iq2000/iq2000.c,
config/lynx.h, config/m68k/m68k.c, config/pa/pa.c, config/sh/sh.h,
config/stormy16/stormy16.c, config/v850/v850.c,
config/vax/netbsd-elf.h, coverage.c, dwarf2out.c, emit-rtl.c,
except.c, gcc.c, tree-cfg.c, tree-eh.c, tree-ssa.c, xcoffout.c:
Avoid "." or "\n" at end of diagnostics and capital letters at
start of diagnostics.
* combine.c, cse.c: Don't translate dump file output.
* toplev.c (print_version): Only translate output if going to
stderr.
From-SVN: r101561
2005-07-03 23:08:11 +02:00
|
|
|
|
error ("unnecessary EH edge %i->%i", bb->index, e->dest->index);
|
2005-04-25 19:24:28 +02:00
|
|
|
|
mark_eh_edge_found_error = true;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
e->aux = NULL;
|
|
|
|
|
}
|
|
|
|
|
return mark_eh_edge_found_error;
|
|
|
|
|
}
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
|
2004-06-29 08:59:35 +02:00
|
|
|
|
/* Return true if the expr can trap, as in dereferencing an invalid pointer
|
|
|
|
|
location or floating point arithmetic. C.f. the rtl version, may_trap_p.
|
|
|
|
|
This routine expects only GIMPLE lhs or rhs input. */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
tree_could_trap_p (tree expr)
|
|
|
|
|
{
|
|
|
|
|
enum tree_code code = TREE_CODE (expr);
|
2004-06-29 08:59:35 +02:00
|
|
|
|
bool honor_nans = false;
|
|
|
|
|
bool honor_snans = false;
|
|
|
|
|
bool fp_operation = false;
|
2004-07-11 20:14:48 +02:00
|
|
|
|
bool honor_trapv = false;
|
2005-03-09 12:31:51 +01:00
|
|
|
|
tree t, base;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
alias.c (find_base_decl): Remove unreachable case '3' block.
2004-09-17 Jeffrey D. Oldham <oldham@codesourcery.com>
Zack Weinberg <zack@codesourcery.com>
* alias.c (find_base_decl): Remove unreachable case '3' block.
* expr.c (safe_from_p): Abort if passed a type.
* tree-gimple.c (recalculate_side_effects): Abort if passed
anything other than an expression.
* tree-ssa-pre.c (phi_translate): Return expr immediately if
is_gimple_min_invariant is true for it. Reorder cases for clarity.
Abort on un-handled tree classes.
(valid_in_set): Likewise.
* tree.c (tree_code_class_strings): New static data.
* tree.h (enum tree_code_class): New.
(tree_code_class_strings): Declare.
(TREE_CODE_CLASS_STRING, EXCEPTIONAL_CLASS_P, CONSTANT_CLASS_P)
(REFERENCE_CLASS_P, COMPARISON_CLASS_P, UNARY_CLASS_P, BINARY_CLASS_P)
(STATEMENT_CLASS_P, EXPRESSION_CLASS_P, IS_TYPE_OR_DECL_P): New macros.
(TYPE_P, DECL_P, IS_NON_TYPE_CODE_CLASS, IS_EXPR_CODE_CLASS)
(checking macros, EXPR_LOCATION, SET_EXPR_LOCATION, EXPR_LOCUS): Update.
* tree.def, c-common.def, objc/objc-tree.def: Use
tree_code_class enumeration constants instead of code letters.
* alias.c, builtins.c, c-common.c, c-format.c, c-lang.c, c-pragma.c
* c-typeck.c, cgraphunit.c, convert.c, dbxout.c, dwarf2out.c
* emit-rtl.c expr.c, fold-const.c, gimplify.c, lambda-code.c
* langhooks.c, langhooks.h, predict.c, print-tree.c, reload1.c, stmt.c
* tree-browser.c, tree-cfg.c, tree-chrec.c, tree-complex.c, tree-dfa.c
* tree-dump.c, tree-eh.c, tree-gimple.c, tree-inline.c, tree-nested.c
* tree-outof-ssa.c, tree-pretty-print.c, tree-sra.c, tree-ssa-ccp.c
* tree-ssa-dce.c, tree-ssa-dom.c, tree-ssa-forwprop.c, tree-ssa-live.c
* tree-ssa-loop-im.c, tree-ssa-loop-ivopts.c, tree-ssa-operands.c
* tree-ssa-phiopt.c, tree-ssa-pre.c, tree-ssa-propagate.c
* tree-ssa.c, tree-ssanames.c, tree-tailcall.c, tree.c, varasm.c
* config/sol2-c.c, config/arm/arm.c, config/i386/winnt.c
* config/pa/pa.c, config/pa/pa.h, config/sh/sh.c, objc/objc-lang.c
Update to match.
* LANGUAGES: Add note about change.
ada:
* ada-tree.def: Use tree_code_class enumeration constants
instead of code letters.
* ada-tree.h, decl.c, misc.c, trans.c, utils.c, utils2.c:
Update for new tree-class enumeration constants.
cp:
* cp-tree.def: Use tree_code_class enumeration constants
instead of code letters.
* call.c, class.c, cp-gimplify.c, cp-lang.c, cxx-pretty-print.c
* mangle.c, pt.c, semantics.c, tree.c, typeck.c:
Update for new tree-class enumeration constants.
fortran:
* f95-lang.c, trans-expr.c, trans.c: Update for new tree-class
enumeration constants.
java:
* java-tree.def: Use tree_code_class enumeration constants
instead of code letters.
* java-gimplify.c, jcf-write.c, lang.c, parse.y: Update for
new tree-class enumeration constants.
treelang:
* treetree.c: Update for new tree-class enumeration constants.
From-SVN: r87675
2004-09-17 23:55:02 +02:00
|
|
|
|
if (TREE_CODE_CLASS (code) == tcc_comparison
|
|
|
|
|
|| TREE_CODE_CLASS (code) == tcc_unary
|
|
|
|
|
|| TREE_CODE_CLASS (code) == tcc_binary)
|
2004-06-29 08:59:35 +02:00
|
|
|
|
{
|
|
|
|
|
t = TREE_TYPE (expr);
|
|
|
|
|
fp_operation = FLOAT_TYPE_P (t);
|
|
|
|
|
if (fp_operation)
|
|
|
|
|
{
|
|
|
|
|
honor_nans = flag_trapping_math && !flag_finite_math_only;
|
|
|
|
|
honor_snans = flag_signaling_nans != 0;
|
|
|
|
|
}
|
2007-01-28 06:15:06 +01:00
|
|
|
|
else if (INTEGRAL_TYPE_P (t) && TYPE_OVERFLOW_TRAPS (t))
|
2004-07-11 20:14:48 +02:00
|
|
|
|
honor_trapv = true;
|
2004-06-29 08:59:35 +02:00
|
|
|
|
}
|
|
|
|
|
|
2004-07-16 23:13:08 +02:00
|
|
|
|
restart:
|
2004-05-13 08:41:07 +02:00
|
|
|
|
switch (code)
|
|
|
|
|
{
|
tree-ssa-address.c: New file.
* tree-ssa-address.c: New file.
* Makefile.in (tree-ssa-address.o): Add.
* expr.c (expand_expr_real_1): Do not handle REF_ORIGINAL on
INDIRECT_REFs. Handle TARGET_MEM_REFs.
* tree-eh.c (tree_could_trap_p): Handle TARGET_MEM_REFs.
* tree-flow.h (struct mem_address): New.
(struct affine_tree_combination): Moved from tree-ssa-loop-ivopts.c.
(create_mem_ref, addr_for_mem_ref, get_address_description,
maybe_fold_tmr, multiplier_allowed_in_address_p,
multiply_by_cost): Declare.
* tree-mudflap.c (mf_xform_derefs_1): Handle TARGET_MEM_REFs.
* tree-pretty-print.c (dump_generic_node): Ditto.
* tree-ssa-loop-im.c (for_each_index): Ditto.
* tree-ssa-loop-ivopts.c (may_be_unaligned_p,
find_interesting_uses_address): Ditto.
(rewrite_address_base, build_addr_strip_iref): Removed.
(struct affine_tree_combination): Moved to tree-flow.h.
(get_ref_tag, copy_ref_info): New functions.
(rewrite_use_address): Produce TARGET_MEM_REFs.
(tree_ssa_iv_optimize): Do not call update_ssa
and rewrite_into_loop_closed_ssa.
(tree_to_aff_combination): Use build_fold_addr_expr instead of
build_addr_strip_iref.
(unshare_aff_combination): New function.
(fold_affine_sum): Removed.
(get_computation_at): Use get_computation_aff. Unshare the result.
(get_computation_aff, multiplier_allowed_in_address_p): New function.
(multiply_by_cost): Exported.
(get_address_cost): Use multiplier_allowed_in_address_p.
* tree-ssa-operands.c (get_tmr_operands): New function.
(get_expr_operands): Handle TARGET_MEM_REFs.
* tree.c (copy_node_stat): Copy annotations for TARGET_MEM_REFs.
(build): Handle 7 arguments.
(build7_stat): New function.
* tree.def (TARGET_MEM_DEF): New.
* tree.h (REF_ORIGINAL): Removed.
(TMR_SYMBOL, TMR_BASE, TMR_INDEX, TMR_STEP, TMR_OFFSET, TMR_ORIGINAL,
TMR_TAG, build7): New macros.
(build7_stat, tree_mem_ref_addr, copy_mem_ref_info): Declare.
* tree-ssa-ccp.c (fold_stmt_r): Call maybe_fold_tmr.
* doc/c-tree.texi: Document TARGET_MEM_REF.
* doc/tree-ssa.texi: Add TARGET_MEM_REF to gimple grammar.
* gcc.dg/tree-ssa/loop-2.c: Update outcome.
* gcc.dg/tree-ssa/loop-3.c: Update outcome.
* gcc.dg/tree-ssa/loop-4.c: Update outcome.
* gcc.dg/tree-ssa/loop-9.c: New test.
From-SVN: r100708
2005-06-07 14:01:47 +02:00
|
|
|
|
case TARGET_MEM_REF:
|
|
|
|
|
/* For TARGET_MEM_REFs use the information based on the original
|
|
|
|
|
reference. */
|
|
|
|
|
expr = TMR_ORIGINAL (expr);
|
|
|
|
|
code = TREE_CODE (expr);
|
|
|
|
|
goto restart;
|
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
case COMPONENT_REF:
|
|
|
|
|
case REALPART_EXPR:
|
|
|
|
|
case IMAGPART_EXPR:
|
|
|
|
|
case BIT_FIELD_REF:
|
2004-07-16 23:13:08 +02:00
|
|
|
|
case WITH_SIZE_EXPR:
|
|
|
|
|
expr = TREE_OPERAND (expr, 0);
|
|
|
|
|
code = TREE_CODE (expr);
|
|
|
|
|
goto restart;
|
2004-07-10 06:57:58 +02:00
|
|
|
|
|
|
|
|
|
case ARRAY_RANGE_REF:
|
2006-07-03 22:14:18 +02:00
|
|
|
|
base = TREE_OPERAND (expr, 0);
|
|
|
|
|
if (tree_could_trap_p (base))
|
2004-07-10 06:57:58 +02:00
|
|
|
|
return true;
|
|
|
|
|
|
2006-07-03 22:14:18 +02:00
|
|
|
|
if (TREE_THIS_NOTRAP (expr))
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
return !range_in_array_bounds_p (expr);
|
2004-07-10 06:57:58 +02:00
|
|
|
|
|
|
|
|
|
case ARRAY_REF:
|
|
|
|
|
base = TREE_OPERAND (expr, 0);
|
|
|
|
|
if (tree_could_trap_p (base))
|
|
|
|
|
return true;
|
|
|
|
|
|
|
|
|
|
if (TREE_THIS_NOTRAP (expr))
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
return !in_array_bounds_p (expr);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
|
|
case INDIRECT_REF:
|
tree.def (ALIGN_INDIRECT_REF, [...]): New tree-codes.
2004-09-23 Dorit Naishlos <dorit@il.ibm.com>
* tree.def (ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF):
New tree-codes.
* tree.h (REF_ORIGINAL): Consider ALIGN_INDIRECT_REF and
MISALIGNED_INDIRECT_REF.
* alias.c (get_alias_set, nonoverlapping_memrefs_p): Likewise.
* emit-rtl.c (mem_expr_equal_p, set_mem_attributes_minus_bitpos):
Likewise.
* expr.c (safe_from_p, expand_expr_real_1, rewrite_address_base)
(find_interesting_uses_address): Likewise.
* fold-const.c (non_lvalue, operand_equal_p): Likewise.
(build_fold_addr_expr_with_type): Likewise.
* gimplify.c (gimplify_addr_expr, gimplify_expr): Likewise.
* print-rtl.c (print_mem_expr): Likewise.
* tree-dump.c (dequeue_and_dump): Likewise.
* tree-eh.c (tree_could_trap_p): Likewise.
* tree-gimple.c (is_gimple_addressable, get_base_address): Likewise.
* tree-pretty-print.c (op_prio, op_symbol, dump_generic_node): Likewise.
* tree-ssa-alias.c (find_ptr_dereference, ptr_is_dereferenced_by):
Likewise.
* tree-ssa-dce.c (mark_stmt_if_obviously_necessary): Likewise.
* tree-ssa-dom.c (record_equivalences_from_stmt): Likewise.
* tree-ssa-loop-im.c (for_each_index, is_call_clobbered_ref): Likewise.
* tree-ssa-loop-ivopts.c (find_interesting_uses_address): Likewise.
(add_address_candidates, rewrite_address_base): Likewise.
* tree-ssa-operands.c (get_expr_operands, get_indirect_ref_operands):
Likewise.
* tree.c (staticp, build1_stat): Likewise.
* tree.def (REALIGN_LOAD_EXPR, REALIGN_STORE_EXPR): New tree-codes.
* tree-pretty-print.c (dump_generic_node): Consider REALIGN_LOAD_EXPR.
* tree-ssa-operands.c (get_expr_operands): Likewise.
* expr.c (expand_expr_real_1): Likewise.
* optabs.h (vec_realign_store_optab, vec_realign_load_optab): New
optabs.
(OTI_vec_realign_store, OTI_vec_realign_load): New optab_index values
for the new optabs.
(expand_ternary_op): New function.
* genopinit.c (optabs): Handle the new optabs.
* optabs.c (optab_for_tree_code): Add cases for the new tree-codes.
(init_optabs): Initialize vec_realign_load_optab.
(expand_ternary_op): New functions.
* target-def.h (TARGET_VECTORIZE): New member for struct gcc_target.
(TARGET_VECTORIZE_MISALIGNED_MEM_OK): New member for targetm.vectorize.
(TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD): Likewise.
(TARGET_VECTORIZE_BUILTIN_MASK_FOR_STORE): Likewise.
* target.h (struct vectorize): New member for struct gcc_target.
(misaligned_mem_ok): New member for targetm.vectorize.
(builtin_mask_for_load): Likewise.
(builtin_mask_for_store): Likewise.
* targethooks.c (default_vect_misaligned_mem_ok): New function.
* targethooks.h (default_vect_misaligned_mem_ok): New function.
* config/rs6000/altivec.md (build_vector_mask_for_load): New
define_expand.
(vec_realign_load_v4si, vec_realign_load_v4sf, vec_realign_load_v8hi)
(vec_realign_load_v16qi): New define_insn.
* config/rs6000/rs6000.h (ALTIVEC_BUILTIN_MASK_FOR_LOAD):
(ALTIVEC_BUILTIN_MASK_FOR_STORE): New target builtins.
* config/rs6000/rs6000.c (altivec_builtin_mask_for_load):
(altivec_builtin_mask_for_store): New variables.
(rs6000_builtin_mask_for_load): New function. Implements
TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD.
(rs6000_builtin_mask_for_store): New function. Implements
TARGET_VECTORIZE_BUILTIN_MASK_FOR_STORE.
(rs6000_expand_builtin): Expand the target builtins
builtin_mask_for_load and builtin_mask_for_store.
(altivec_init_builtins): Initialize the new target builtins.
* config/i386/i386.c (ix86_misaligned_mem_ok): New function.
Implements the target hook TARGET_VECTORIZE_MISALIGNED_MEM_OK.
* tree-vectorizer.c (vect_create_data_ref): Renamed to
vect_create_data_ref_ptr. Returns a pointer instead of an array-ref.
(vect_create_addr_base_for_vector_ref): Additional argument (offset).
(vectorizable_store): Call vect_create_data_ref_ptr with additional
arguments, and create an indirect_ref with its return value data_ref.
Check aligned_access_p.
(vectorizable_load): Handle misaligned loads, using software-pipelined
scheme with REALIGN_LOAD_EXPR and ALIGN_INDIRECT_REF if
vec_realign_load_optab is supported, or using a scheme without
software-pipelining with MISALIGNED_INDIRECT_REF if the target hook
misaligned_mem_ok is supported.
(vect_finish_stmt_generation): Typo.
(vect_enhance_data_refs_alignment): Rename loop_vinfo to loop_info.
(vect_analyze_data_refs_alignment): Don't fail vectorization in the
presence of misaligned loads.
(vect_analyze_data_ref_access): Add check for constant init.
(vect_get_symbl_and_dr): Remove duplicate line.
* tree-vectorizer.h (DR_MISALIGNMENT): Add comment.
From-SVN: r87948
2004-09-23 16:34:35 +02:00
|
|
|
|
case ALIGN_INDIRECT_REF:
|
|
|
|
|
case MISALIGNED_INDIRECT_REF:
|
2004-06-29 08:59:35 +02:00
|
|
|
|
return !TREE_THIS_NOTRAP (expr);
|
|
|
|
|
|
|
|
|
|
case ASM_EXPR:
|
|
|
|
|
return TREE_THIS_VOLATILE (expr);
|
2004-06-26 12:10:25 +02:00
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
case TRUNC_DIV_EXPR:
|
|
|
|
|
case CEIL_DIV_EXPR:
|
|
|
|
|
case FLOOR_DIV_EXPR:
|
|
|
|
|
case ROUND_DIV_EXPR:
|
|
|
|
|
case EXACT_DIV_EXPR:
|
|
|
|
|
case CEIL_MOD_EXPR:
|
|
|
|
|
case FLOOR_MOD_EXPR:
|
|
|
|
|
case ROUND_MOD_EXPR:
|
|
|
|
|
case TRUNC_MOD_EXPR:
|
2004-06-29 08:59:35 +02:00
|
|
|
|
case RDIV_EXPR:
|
2004-07-11 20:14:48 +02:00
|
|
|
|
if (honor_snans || honor_trapv)
|
2004-06-29 08:59:35 +02:00
|
|
|
|
return true;
|
2005-04-05 00:50:53 +02:00
|
|
|
|
if (fp_operation)
|
|
|
|
|
return flag_trapping_math;
|
2004-06-29 08:59:35 +02:00
|
|
|
|
t = TREE_OPERAND (expr, 1);
|
|
|
|
|
if (!TREE_CONSTANT (t) || integer_zerop (t))
|
|
|
|
|
return true;
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
case LT_EXPR:
|
|
|
|
|
case LE_EXPR:
|
|
|
|
|
case GT_EXPR:
|
|
|
|
|
case GE_EXPR:
|
|
|
|
|
case LTGT_EXPR:
|
|
|
|
|
/* Some floating point comparisons may trap. */
|
|
|
|
|
return honor_nans;
|
|
|
|
|
|
|
|
|
|
case EQ_EXPR:
|
|
|
|
|
case NE_EXPR:
|
|
|
|
|
case UNORDERED_EXPR:
|
|
|
|
|
case ORDERED_EXPR:
|
|
|
|
|
case UNLT_EXPR:
|
|
|
|
|
case UNLE_EXPR:
|
|
|
|
|
case UNGT_EXPR:
|
|
|
|
|
case UNGE_EXPR:
|
|
|
|
|
case UNEQ_EXPR:
|
|
|
|
|
return honor_snans;
|
|
|
|
|
|
|
|
|
|
case CONVERT_EXPR:
|
|
|
|
|
case FIX_TRUNC_EXPR:
|
|
|
|
|
/* Conversion of floating point might trap. */
|
|
|
|
|
return honor_nans;
|
|
|
|
|
|
|
|
|
|
case NEGATE_EXPR:
|
|
|
|
|
case ABS_EXPR:
|
|
|
|
|
case CONJ_EXPR:
|
2004-07-11 20:14:48 +02:00
|
|
|
|
/* These operations don't trap with floating point. */
|
|
|
|
|
if (honor_trapv)
|
|
|
|
|
return true;
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
case PLUS_EXPR:
|
|
|
|
|
case MINUS_EXPR:
|
|
|
|
|
case MULT_EXPR:
|
|
|
|
|
/* Any floating arithmetic may trap. */
|
|
|
|
|
if (fp_operation && flag_trapping_math)
|
|
|
|
|
return true;
|
|
|
|
|
if (honor_trapv)
|
|
|
|
|
return true;
|
2004-06-29 08:59:35 +02:00
|
|
|
|
return false;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
2005-02-17 23:32:29 +01:00
|
|
|
|
case CALL_EXPR:
|
|
|
|
|
t = get_callee_fndecl (expr);
|
|
|
|
|
/* Assume that calls to weak functions may trap. */
|
|
|
|
|
if (!t || !DECL_P (t) || DECL_WEAK (t))
|
|
|
|
|
return true;
|
|
|
|
|
return false;
|
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
|
default:
|
2004-06-29 08:59:35 +02:00
|
|
|
|
/* Any floating arithmetic may trap. */
|
|
|
|
|
if (fp_operation && flag_trapping_math)
|
|
|
|
|
return true;
|
|
|
|
|
return false;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
tree_could_throw_p (tree t)
|
|
|
|
|
{
|
|
|
|
|
if (!flag_exceptions)
|
|
|
|
|
return false;
|
2006-12-05 18:26:05 +01:00
|
|
|
|
if (TREE_CODE (t) == GIMPLE_MODIFY_STMT)
|
2004-05-13 08:41:07 +02:00
|
|
|
|
{
|
2004-06-11 20:41:47 +02:00
|
|
|
|
if (flag_non_call_exceptions
|
2006-12-05 18:26:05 +01:00
|
|
|
|
&& tree_could_trap_p (GIMPLE_STMT_OPERAND (t, 0)))
|
2004-06-11 20:41:47 +02:00
|
|
|
|
return true;
|
2006-12-05 18:26:05 +01:00
|
|
|
|
t = GIMPLE_STMT_OPERAND (t, 1);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
2004-07-16 23:13:08 +02:00
|
|
|
|
if (TREE_CODE (t) == WITH_SIZE_EXPR)
|
|
|
|
|
t = TREE_OPERAND (t, 0);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (TREE_CODE (t) == CALL_EXPR)
|
|
|
|
|
return (call_expr_flags (t) & ECF_NOTHROW) == 0;
|
2004-06-11 20:41:47 +02:00
|
|
|
|
if (flag_non_call_exceptions)
|
|
|
|
|
return tree_could_trap_p (t);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
tree_can_throw_internal (tree stmt)
|
|
|
|
|
{
|
2005-05-14 16:32:39 +02:00
|
|
|
|
int region_nr;
|
2005-05-28 00:50:41 +02:00
|
|
|
|
bool is_resx = false;
|
2005-05-14 16:32:39 +02:00
|
|
|
|
|
|
|
|
|
if (TREE_CODE (stmt) == RESX_EXPR)
|
2005-05-28 00:50:41 +02:00
|
|
|
|
region_nr = TREE_INT_CST_LOW (TREE_OPERAND (stmt, 0)), is_resx = true;
|
2005-05-14 16:32:39 +02:00
|
|
|
|
else
|
|
|
|
|
region_nr = lookup_stmt_eh_region (stmt);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (region_nr < 0)
|
|
|
|
|
return false;
|
2005-05-28 00:50:41 +02:00
|
|
|
|
return can_throw_internal_1 (region_nr, is_resx);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
tree_can_throw_external (tree stmt)
|
|
|
|
|
{
|
2005-05-14 16:32:39 +02:00
|
|
|
|
int region_nr;
|
2005-05-28 00:50:41 +02:00
|
|
|
|
bool is_resx = false;
|
2005-05-14 16:32:39 +02:00
|
|
|
|
|
|
|
|
|
if (TREE_CODE (stmt) == RESX_EXPR)
|
2005-05-28 00:50:41 +02:00
|
|
|
|
region_nr = TREE_INT_CST_LOW (TREE_OPERAND (stmt, 0)), is_resx = true;
|
2005-05-14 16:32:39 +02:00
|
|
|
|
else
|
|
|
|
|
region_nr = lookup_stmt_eh_region (stmt);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
if (region_nr < 0)
|
2005-05-14 16:32:39 +02:00
|
|
|
|
return tree_could_throw_p (stmt);
|
|
|
|
|
else
|
2005-05-28 00:50:41 +02:00
|
|
|
|
return can_throw_external_1 (region_nr, is_resx);
|
2004-05-13 08:41:07 +02:00
|
|
|
|
}
|
|
|
|
|
|
2005-05-17 01:14:02 +02:00
|
|
|
|
/* Given a statement OLD_STMT and a new statement NEW_STMT that has replaced
|
|
|
|
|
OLD_STMT in the function, remove OLD_STMT from the EH table and put NEW_STMT
|
|
|
|
|
in the table if it should be in there. Return TRUE if a replacement was
|
|
|
|
|
done that my require an EH edge purge. */
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
maybe_clean_or_replace_eh_stmt (tree old_stmt, tree new_stmt)
|
2004-06-29 08:59:35 +02:00
|
|
|
|
{
|
2005-05-17 01:14:02 +02:00
|
|
|
|
int region_nr = lookup_stmt_eh_region (old_stmt);
|
|
|
|
|
|
|
|
|
|
if (region_nr >= 0)
|
|
|
|
|
{
|
|
|
|
|
bool new_stmt_could_throw = tree_could_throw_p (new_stmt);
|
|
|
|
|
|
|
|
|
|
if (new_stmt == old_stmt && new_stmt_could_throw)
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
remove_stmt_from_eh_region (old_stmt);
|
|
|
|
|
if (new_stmt_could_throw)
|
|
|
|
|
{
|
|
|
|
|
add_stmt_to_eh_region (new_stmt, region_nr);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2004-06-29 08:59:35 +02:00
|
|
|
|
return false;
|
|
|
|
|
}
|