* ChangeLog.1: Fix typos.
* cse.c: Fix a comment typo.
* reload1.c: Likewise.
From-SVN: r58596
+2002-10-28 Kazu Hirata <kazu@cs.umass.edu>
+
+ * ChangeLog.1: Fix typos.
+ * cse.c: Fix a comment typo.
+ * reload1.c: Likewise.
+
2002-10-27 Hans-Peter Nilsson <hp@bitrange.com>
* fixinc/inclhack.def (libc1_G_va_list): Correct test_text.
2002-10-27 Hans-Peter Nilsson <hp@bitrange.com>
* fixinc/inclhack.def (libc1_G_va_list): Correct test_text.
Thu Apr 8 19:20:18 1999 Jeffrey A Law (law@cygnus.com)
* expr.c (expand_expr, case ARRAY_REF, COMPONENT_REF, BIT_FIELD_REF):
Thu Apr 8 19:20:18 1999 Jeffrey A Law (law@cygnus.com)
* expr.c (expand_expr, case ARRAY_REF, COMPONENT_REF, BIT_FIELD_REF):
- Do not try to optimize a aggregate address which has VOIDmode.
+ Do not try to optimize an aggregate address which has VOIDmode.
Mirrors March 23 change to expand_assignment.
* flow.c (delete_unreachable_blocks): Do not require EDGE_FALLTHRU
Mirrors March 23 change to expand_assignment.
* flow.c (delete_unreachable_blocks): Do not require EDGE_FALLTHRU
left using a variable rotate right. Provide anonymous pattern for
rotate left by a constant value.
left using a variable rotate right. Provide anonymous pattern for
rotate left by a constant value.
- * expr.c (expand_assignment): Do not try to optimize a aggregate
+ * expr.c (expand_assignment): Do not try to optimize an aggregate
address which has VOIDmode.
Tue Mar 23 22:51:48 1999 Mumit Khan <khan@xraylith.wisc.edu>
address which has VOIDmode.
Tue Mar 23 22:51:48 1999 Mumit Khan <khan@xraylith.wisc.edu>
preferrable (cost_a, regcost_a, cost_b, regcost_b)
int cost_a, regcost_a, cost_b, regcost_b;
{
preferrable (cost_a, regcost_a, cost_b, regcost_b)
int cost_a, regcost_a, cost_b, regcost_b;
{
- /* First, get rid of a cases involving expressions that are entirely
+ /* First, get rid of cases involving expressions that are entirely
unwanted. */
if (cost_a != cost_b)
{
unwanted. */
if (cost_a != cost_b)
{
insn. The changes we make were determined by the earlier call to
elimination_effects.
insn. The changes we make were determined by the earlier call to
elimination_effects.
- We also detect a cases where register elimination cannot be done,
+ We also detect cases where register elimination cannot be done,
namely, if a register would be both changed and referenced outside a MEM
in the resulting insn since such an insn is often undefined and, even if
not, we cannot know what meaning will be given to it. Note that it is
namely, if a register would be both changed and referenced outside a MEM
in the resulting insn since such an insn is often undefined and, even if
not, we cannot know what meaning will be given to it. Note that it is