summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorpaolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4>2009-11-24 16:53:17 +0000
committerpaolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4>2009-11-24 16:53:17 +0000
commitd52d7a3afb8f4fb1243dfd399400f16e57214d35 (patch)
tree6be018fb02b4d16d658f952c905e38c1c1c753d1
parentdf9d2e34d3ee6a79dde156c97d56935b7d7371f7 (diff)
downloadgcc-d52d7a3afb8f4fb1243dfd399400f16e57214d35.tar.gz
2009-11-24 Michael Matz <matz@suse.de>
* expr.c (set_storage_via_libcall): Fix build_call_expr call. 2009-11-24 David Binderman <dcb314@hotmail.com> * expr.c (store_field): Remove set but not used local variable width_mask. (expand_expr_real_2): Remove treeop2. * gcse.c (update_ld_motion_stores): Remove new_rtx. * haifa-sched.c (max_issue): Remove points. (sched_create_recovery_edges): Remove e. * ira-costs.c (setup_allocno_cover_class_and_costs): Remove mode. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@154505 138bc75d-0d04-0410-961f-82ee72b054a4
-rw-r--r--gcc/ChangeLog14
-rw-r--r--gcc/expr.c10
-rw-r--r--gcc/gcse.c4
-rw-r--r--gcc/haifa-sched.c6
-rw-r--r--gcc/ira-costs.c2
5 files changed, 20 insertions, 16 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 197ada720f4..fb72b46c8b1 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,17 @@
+2009-11-24 Michael Matz <matz@suse.de>
+
+ * expr.c (set_storage_via_libcall): Fix build_call_expr call.
+
+2009-11-24 David Binderman <dcb314@hotmail.com>
+
+ * expr.c (store_field): Remove set but not used local variable
+ width_mask.
+ (expand_expr_real_2): Remove treeop2.
+ * gcse.c (update_ld_motion_stores): Remove new_rtx.
+ * haifa-sched.c (max_issue): Remove points.
+ (sched_create_recovery_edges): Remove e.
+ * ira-costs.c (setup_allocno_cover_class_and_costs): Remove mode.
+
2009-11-24 Nick Clifton <nickc@redhat.com>
* config/v850/v850.c (function_arg): Fix handling of zero-length
diff --git a/gcc/expr.c b/gcc/expr.c
index 66810032a48..923db8f49c8 100644
--- a/gcc/expr.c
+++ b/gcc/expr.c
@@ -2712,8 +2712,7 @@ set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
val_tree = make_tree (integer_type_node, val);
fn = clear_storage_libcall_fn (true);
- call_expr = build_call_expr (fn, 3,
- object_tree, integer_zero_node, size_tree);
+ call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
CALL_EXPR_TAILCALL (call_expr) = tailcall;
retval = expand_normal (call_expr);
@@ -5762,8 +5761,6 @@ store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
enum machine_mode mode, tree exp, tree type,
alias_set_type alias_set, bool nontemporal)
{
- HOST_WIDE_INT width_mask = 0;
-
if (TREE_CODE (exp) == ERROR_MARK)
return const0_rtx;
@@ -5771,8 +5768,6 @@ store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
side-effects. */
if (bitsize == 0)
return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
- else if (bitsize >= 0 && bitsize < HOST_BITS_PER_WIDE_INT)
- width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
/* If we are storing into an unaligned field of an aligned union that is
in a register, we may have the mode of TARGET being an integer mode but
@@ -7213,7 +7208,7 @@ expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
gimple subexp0_def, subexp1_def;
tree top0, top1;
location_t loc = ops->location;
- tree treeop0, treeop1, treeop2;
+ tree treeop0, treeop1;
#define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
? reduce_to_bit_field_precision ((expr), \
target, \
@@ -7226,7 +7221,6 @@ expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
treeop0 = ops->op0;
treeop1 = ops->op1;
- treeop2 = ops->op2;
/* We should be called only on simple (binary or unary) expressions,
exactly those that are valid in gimple expressions that aren't
diff --git a/gcc/gcse.c b/gcc/gcse.c
index e6514e7cce5..0da075f2585 100644
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -4884,7 +4884,7 @@ update_ld_motion_stores (struct expr * expr)
rtx pat = PATTERN (insn);
rtx src = SET_SRC (pat);
rtx reg = expr->reaching_reg;
- rtx copy, new_rtx;
+ rtx copy;
/* If we've already copied it, continue. */
if (expr->reaching_reg == src)
@@ -4900,7 +4900,7 @@ update_ld_motion_stores (struct expr * expr)
}
copy = gen_move_insn (reg, copy_rtx (SET_SRC (pat)));
- new_rtx = emit_insn_before (copy, insn);
+ emit_insn_before (copy, insn);
SET_SRC (pat) = reg;
df_insn_rescan (insn);
diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index 7cbe1ecee51..1f05a7231f6 100644
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -2503,7 +2503,7 @@ int
max_issue (struct ready_list *ready, int privileged_n, state_t state,
int *index)
{
- int n, i, all, n_ready, best, delay, tries_num, points = -1, max_points;
+ int n, i, all, n_ready, best, delay, tries_num, max_points;
int more_issue;
struct choice_entry *top;
rtx insn;
@@ -2593,7 +2593,6 @@ max_issue (struct ready_list *ready, int privileged_n, state_t state,
/* This is the index of the insn issued first in this
solution. */
*index = choice_stack [1].index;
- points = top->n;
if (top->n == max_points || best == all)
break;
}
@@ -4462,7 +4461,6 @@ sched_create_recovery_edges (basic_block first_bb, basic_block rec,
{
rtx label;
rtx jump;
- edge e;
int edge_flags;
/* This is fixing of incoming edge. */
@@ -4473,7 +4471,7 @@ sched_create_recovery_edges (basic_block first_bb, basic_block rec,
else
edge_flags = 0;
- e = make_edge (first_bb, rec, edge_flags);
+ make_edge (first_bb, rec, edge_flags);
label = block_label (second_bb);
jump = emit_jump_insn_after (gen_jump (label), BB_END (rec));
JUMP_LABEL (jump) = label;
diff --git a/gcc/ira-costs.c b/gcc/ira-costs.c
index 4b9d29f1db1..f74a2cac433 100644
--- a/gcc/ira-costs.c
+++ b/gcc/ira-costs.c
@@ -1534,7 +1534,6 @@ setup_allocno_cover_class_and_costs (void)
int i, j, n, regno, num;
int *reg_costs;
enum reg_class cover_class, rclass;
- enum machine_mode mode;
ira_allocno_t a;
ira_allocno_iterator ai;
@@ -1542,7 +1541,6 @@ setup_allocno_cover_class_and_costs (void)
FOR_EACH_ALLOCNO (a, ai)
{
i = ALLOCNO_NUM (a);
- mode = ALLOCNO_MODE (a);
cover_class = regno_cover_class[ALLOCNO_REGNO (a)];
ira_assert (pref[i] == NO_REGS || cover_class != NO_REGS);
ALLOCNO_MEMORY_COST (a) = COSTS (costs, i)->mem_cost;