From d844aaccb2f8f85d240b700657795074b7580c9b Mon Sep 17 00:00:00 2001 From: ghazi Date: Wed, 6 Oct 1999 14:48:41 +0000 Subject: * collect2.c (scan_prog_file, scan_libraries): Prototype function pointers and casts for `int_handler' and `quit_handler'. * flow.c (verify_flow_info, split_hard_reg_notes, find_insn_with_note, sets_reg_or_subreg_1, prepend_reg_notes, remove_edge, remove_fake_successors): Add static prototypes. (verify_flow_info): Wrap with macro ENABLE_CHECKING. (mark_set_1): Initialize variable `regno'. (unlink_insn_chain): Likewise for variable `curr'. (remove_fake_edges): Remove unused variables `e', `tmp' and `last'. * loop.c (strength_reduce): Initialize variable `unrolled_insn_copies'. (cmp_combine_givs_stats, cmp_recombine_givs_stats): Add static prototypes. Change these functions to take const PTR parameters to avoid prototype conflict when used as the comparson argument for qsort. (check_dbra_loop): Initialize variable `comparison_val'. * reload.c (debug_reload_to_stream, debug_reload): Add prototypes. (get_secondary_mem): Mark parameter `x' with ATTRIBUTE_UNUSED. (find_valid_class): Initialize variable `best_class'. (find_reloads): Call memcpy, not bcopy. * reload1.c (gen_mode_int, dump_needs): Add prototypes. (hard_reg_use_compare): Don't needlessly cast away const. (reload_reg_class_lower): Likewise. (choose_reload_regs): Initialize variable `regno'. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@29840 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/loop.c | 28 ++++++++++++++++++++-------- 1 file changed, 20 insertions(+), 8 deletions(-) (limited to 'gcc/loop.c') diff --git a/gcc/loop.c b/gcc/loop.c index 32ac1752ced..40ed922a783 100644 --- a/gcc/loop.c +++ b/gcc/loop.c @@ -3714,7 +3714,7 @@ strength_reduce (scan_start, end, loop_top, insn_count, rtx end_insert_before; int loop_depth = 0; int n_extra_increment; - int unrolled_insn_copies; + int unrolled_insn_copies = 0; /* If scan_start points to the loop exit test, we have to be wary of subversive use of gotos inside expression statements. */ @@ -6268,8 +6268,10 @@ general_induction_var (x, src_reg, add_val, mult_val, is_addr, pbenefit) *BENEFIT will be incremented by the benefit of any sub-giv encountered. */ -static rtx sge_plus PROTO ((enum machine_mode, rtx, rtx)); -static rtx sge_plus_constant PROTO ((rtx, rtx)); +static rtx sge_plus PARAMS ((enum machine_mode, rtx, rtx)); +static rtx sge_plus_constant PARAMS ((rtx, rtx)); +static int cmp_combine_givs_stats PARAMS ((const PTR, const PTR)); +static int cmp_recombine_givs_stats PARAMS ((const PTR, const PTR)); static rtx simplify_giv_expr (x, benefit) @@ -7015,9 +7017,14 @@ struct combine_givs_stats }; static int -cmp_combine_givs_stats (x, y) - struct combine_givs_stats *x, *y; +cmp_combine_givs_stats (xp, yp) + const PTR xp; + const PTR yp; { + const struct combine_givs_stats * const x = + (const struct combine_givs_stats *) xp; + const struct combine_givs_stats * const y = + (const struct combine_givs_stats *) yp; int d; d = y->total_benefit - x->total_benefit; /* Stabilize the sort. */ @@ -7202,9 +7209,14 @@ struct recombine_givs_stats when scanning the array starting at the end, thus the arguments are used in reverse. */ static int -cmp_recombine_givs_stats (x, y) - struct recombine_givs_stats *x, *y; +cmp_recombine_givs_stats (xp, yp) + const PTR xp; + const PTR yp; { + const struct recombine_givs_stats * const x = + (const struct recombine_givs_stats *) xp; + const struct recombine_givs_stats * const y = + (const struct recombine_givs_stats *) yp; int d; d = y->start_luid - x->start_luid; /* Stabilize the sort. */ @@ -7994,7 +8006,7 @@ check_dbra_loop (loop_end, insn_count, loop_start, loop_info) || (GET_CODE (comparison) == LE && no_use_except_counting))) { - HOST_WIDE_INT add_val, add_adjust, comparison_val; + HOST_WIDE_INT add_val, add_adjust, comparison_val = 0; rtx initial_value, comparison_value; int nonneg = 0; enum rtx_code cmp_code; -- cgit v1.2.1