diff options
| author | Nathan Sidwell <nathan@gcc.gnu.org> | 2005-04-21 15:47:33 +0000 |
|---|---|---|
| committer | Nathan Sidwell <nathan@gcc.gnu.org> | 2005-04-21 15:47:33 +0000 |
| commit | 41806d92af91cf26e52aa00a536cf3094ef2648b (patch) | |
| tree | d321c52c21dedb7b851a7e57b5ea7c445d44db56 /gcc/lambda-code.c | |
| parent | ac7e839c63bfb19d83e6c81aee68c4435c1915c2 (diff) | |
| download | gcc-41806d92af91cf26e52aa00a536cf3094ef2648b.zip gcc-41806d92af91cf26e52aa00a536cf3094ef2648b.tar.gz gcc-41806d92af91cf26e52aa00a536cf3094ef2648b.tar.bz2 | |
alias.c (true_dependence): Remove 'abort' from comments.
* alias.c (true_dependence): Remove 'abort' from comments. Use
gcc_assert and gcc_unreachable as appropriate.
(canon_true_dependence): Likewise.
* bb-reorder.c (connect_traces): Likewise.
* c-common.c (c_add_case_label): Likewise.
* c-decl.c (finish_function): Likewise.
* caller-save.c (insert_restore, insert_save): Likewise.
* cfg.c (update_bb_profile_for_threading): Likewise.
* cfganal.c (flow_active_insn_p): Likewise.
* cfgexpand.c (add_reg_br_prob_note): Likewise.
* cfgrtl.c (rtl_redirect_edge_and_branch_force, rtl_split_edge,
cfg_layout_merge_blocks): Likewise.
* ifcvt.c (cond_exec_process_insns, merge_if_block,
find_if_block): Likewise.
* integrate.c (allocate_initial_values): Likewise.
* jump.c (reverse_condition, reverse_condition_maybe_unordered,
swap_condition, unsigned_condition, signed_condition,
mark_jump_label, invert_jump_1, rtx_renumbered_equal_p,
reg_or_subregno): Likewise.
* lambda-code.c (lambda_compute_auxillary_space,
lambda_transform_legal_p): Likewise.
* lambda-mat.c (lambda_matrix_inverse_hard): Likewise.
* langhooks.c (lhd_set_decl_assembler_name, lhd_type_promotes_to,
lhd_incomplete_type_error, lhd_expand_expr,
lhd_types_compatible_p, lhd_tree_size): Likewise.
* lcm.c (create_pre_exit, optimize_mode_switching): Likewise.
* local-alloc.c (update_equiv_regs): Likewise.
* loop-unroll.c (peel_loop_completely
unroll_loop_constant_iterations, unroll_loop_runtime_iterations,
peel_loop_simple, unroll_loop_stupid,
analyze_iv_to_split_insn): Likewise.
* loop.c (gen_prefetch, find_and_verify_loops,
basic_induction_var): Likewise.
* modulo-sched.c (normalize_sched_times, check_nodes_order): Likewise.
* value-prof.c (tree_find_values_to_profile): Likewise.
* varasm.c (named_section, default_assemble_integer,
decode_addr_const): Likewise.
From-SVN: r98508
Diffstat (limited to 'gcc/lambda-code.c')
| -rw-r--r-- | gcc/lambda-code.c | 9 |
1 files changed, 3 insertions, 6 deletions
diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c index da24e95..fbfcdf9 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -687,7 +687,7 @@ lambda_compute_auxillary_space (lambda_loopnest nest, /* Unfortunately, we can't know the number of constraints we'll have ahead of time, but this should be enough even in ridiculous loop nest - cases. We abort if we go over this limit. */ + cases. We must not go over this limit. */ A = lambda_matrix_new (128, depth); B = lambda_matrix_new (128, invariants); a = lambda_vector_new (128); @@ -2483,11 +2483,8 @@ lambda_transform_legal_p (lambda_trans_matrix trans, lambda_vector distres; struct data_dependence_relation *ddr; -#if defined ENABLE_CHECKING - if (LTM_COLSIZE (trans) != nb_loops - || LTM_ROWSIZE (trans) != nb_loops) - abort (); -#endif + gcc_assert (LTM_COLSIZE (trans) == nb_loops + && LTM_ROWSIZE (trans) == nb_loops); /* When there is an unknown relation in the dependence_relations, we know that it is no worth looking at this loop nest: give up. */ |