Commit 07444f1d by Toshiyasu Morita Committed by Jeff Law

fold-const.c (make_range): Always initialize arg0 and arg1.

        * fold-const.c (make_range): Always initialize arg0 and arg1.
        (fold): Simlarly for alt0 and alt1.
        * function.c (fixup_var_refs_insns): Initialize insn_list.
        (instantiate_virtual_regs_1): Initialize offset.
        * optabs.c (expand_binop): Initialize carry_in, carry_out, op0_xhigh
        and op1_xhigh.
        * stmt.c (expand_end_case): Initialize minval and maxval.

From-SVN: r26632
parent c1709d0c
Mon Apr 26 01:08:36 1999 Toshiyasu Morita (tm@netcom.com)
* fold-const.c (make_range): Always initialize arg0 and arg1.
(fold): Simlarly for alt0 and alt1.
* function.c (fixup_var_refs_insns): Initialize insn_list.
(instantiate_virtual_regs_1): Initialize offset.
* optabs.c (expand_binop): Initialize carry_in, carry_out, op0_xhigh
and op1_xhigh.
* stmt.c (expand_end_case): Initialize minval and maxval.
Mon Apr 26 01:02:34 1999 Nathan Sidwell <nathan@acm.org> Mon Apr 26 01:02:34 1999 Nathan Sidwell <nathan@acm.org>
* toplev.c (report_error_function): Reorder file stack and * toplev.c (report_error_function): Reorder file stack and
......
...@@ -3109,7 +3109,7 @@ make_range (exp, pin_p, plow, phigh) ...@@ -3109,7 +3109,7 @@ make_range (exp, pin_p, plow, phigh)
tree *plow, *phigh; tree *plow, *phigh;
{ {
enum tree_code code; enum tree_code code;
tree arg0, arg1, type = NULL_TREE; tree arg0 = NULL_TREE, arg1 = NULL_TREE, type = NULL_TREE;
tree orig_type = NULL_TREE; tree orig_type = NULL_TREE;
int in_p, n_in_p; int in_p, n_in_p;
tree low, high, n_low, n_high; tree low, high, n_low, n_high;
...@@ -4767,7 +4767,7 @@ fold (expr) ...@@ -4767,7 +4767,7 @@ fold (expr)
if (TREE_CODE (arg0) == MULT_EXPR && TREE_CODE (arg1) == MULT_EXPR) if (TREE_CODE (arg0) == MULT_EXPR && TREE_CODE (arg1) == MULT_EXPR)
{ {
tree arg00, arg01, arg10, arg11; tree arg00, arg01, arg10, arg11;
tree alt0, alt1, same; tree alt0 = NULL_TREE, alt1 = NULL_TREE, same;
/* (A * C) + (B * C) -> (A+B) * C. /* (A * C) + (B * C) -> (A+B) * C.
We are most concerned about the case where C is a constant, We are most concerned about the case where C is a constant,
......
...@@ -1827,7 +1827,7 @@ fixup_var_refs_insns (var, promoted_mode, unsignedp, insn, toplevel, ht) ...@@ -1827,7 +1827,7 @@ fixup_var_refs_insns (var, promoted_mode, unsignedp, insn, toplevel, ht)
struct hash_table *ht; struct hash_table *ht;
{ {
rtx call_dest = 0; rtx call_dest = 0;
rtx insn_list; rtx insn_list = NULL_RTX;
/* If we already know which INSNs reference VAR there's no need /* If we already know which INSNs reference VAR there's no need
to walk the entire instruction chain. */ to walk the entire instruction chain. */
...@@ -3649,7 +3649,7 @@ instantiate_virtual_regs_1 (loc, object, extra_insns) ...@@ -3649,7 +3649,7 @@ instantiate_virtual_regs_1 (loc, object, extra_insns)
rtx x; rtx x;
RTX_CODE code; RTX_CODE code;
rtx new = 0; rtx new = 0;
HOST_WIDE_INT offset; HOST_WIDE_INT offset = 0;
rtx temp; rtx temp;
rtx seq; rtx seq;
int i, j; int i, j;
......
...@@ -898,7 +898,7 @@ expand_binop (mode, binoptab, op0, op1, target, unsignedp, methods) ...@@ -898,7 +898,7 @@ expand_binop (mode, binoptab, op0, op1, target, unsignedp, methods)
rtx carry_tmp = gen_reg_rtx (word_mode); rtx carry_tmp = gen_reg_rtx (word_mode);
optab otheroptab = binoptab == add_optab ? sub_optab : add_optab; optab otheroptab = binoptab == add_optab ? sub_optab : add_optab;
int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD; int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD;
rtx carry_in, carry_out; rtx carry_in = NULL_RTX, carry_out = NULL_RTX;
rtx xop0, xop1; rtx xop0, xop1;
/* We can handle either a 1 or -1 value for the carry. If STORE_FLAG /* We can handle either a 1 or -1 value for the carry. If STORE_FLAG
...@@ -1068,8 +1068,8 @@ expand_binop (mode, binoptab, op0, op1, target, unsignedp, methods) ...@@ -1068,8 +1068,8 @@ expand_binop (mode, binoptab, op0, op1, target, unsignedp, methods)
rtx op1_high = operand_subword_force (op1, high, mode); rtx op1_high = operand_subword_force (op1, high, mode);
rtx op1_low = operand_subword_force (op1, low, mode); rtx op1_low = operand_subword_force (op1, low, mode);
rtx product = 0; rtx product = 0;
rtx op0_xhigh; rtx op0_xhigh = NULL_RTX;
rtx op1_xhigh; rtx op1_xhigh = NULL_RTX;
/* If the target is the same as one of the inputs, don't use it. This /* If the target is the same as one of the inputs, don't use it. This
prevents problems with the REG_EQUAL note. */ prevents problems with the REG_EQUAL note. */
......
...@@ -5037,7 +5037,7 @@ void ...@@ -5037,7 +5037,7 @@ void
expand_end_case (orig_index) expand_end_case (orig_index)
tree orig_index; tree orig_index;
{ {
tree minval, maxval, range, orig_minval; tree minval = NULL_TREE, maxval = NULL_TREE, range, orig_minval;
rtx default_label = 0; rtx default_label = 0;
register struct case_node *n; register struct case_node *n;
unsigned int count; unsigned int count;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment