summaryrefslogtreecommitdiff
path: root/gcc/reload1.c
diff options
context:
space:
mode:
authorkazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4>2001-10-10 11:33:39 +0000
committerkazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4>2001-10-10 11:33:39 +0000
commit1e625a2ee3cbdec27b9c9666999bbec3e6b3f49a (patch)
tree1354eff221b576ada39ccb796806717a4dcf6fdb /gcc/reload1.c
parent4b68268e90ad2c9c9014b63618f020fc6c9f107b (diff)
downloadgcc-1e625a2ee3cbdec27b9c9666999bbec3e6b3f49a.tar.gz
* calls.c: Fix formatting.
* c-decl.c: Likewise. * cfgcleanup.c: Likewise. * combine.c: Likewise. * cppfiles.c: Likewise. * cpplib.c: Likewise. * cppmacro.c: Likewise. * crtstuff.c: Likewise. * cse.c: Likewise. * dwarf2out.c: Likewise. * expmed.c: Likewise. * expr.c: Likewise. * fold-const.c: Likewise. * function.c: Likewise. * gcse.c: Likewise. * genattrtab.c: Likewise. * ggc-page.c: Likewise. * integrate.c: Likewise. * libgcc2.c: Likewise. * loop.c: Likewise. * optabs.c: Likewise. * profile.c: Likewise. * protoize.c: Likewise. * real.c: Likewise. * recog.c: Likewise. * reload1.c: Likewise. * reload.c: Likewise. * reorg.c: Likewise. * resource.c: Likewise. * sched-rgn.c: Likewise. * sdbout.c: Likewise. * stmt.c: Likewise. * toplev.c: Likewise. * varasm.c: Likewise. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@46145 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/reload1.c')
-rw-r--r--gcc/reload1.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/reload1.c b/gcc/reload1.c
index 74783efaf83..0bdfcb8e6d0 100644
--- a/gcc/reload1.c
+++ b/gcc/reload1.c
@@ -225,7 +225,7 @@ static char spill_indirect_levels;
/* Nonzero if indirect addressing is supported when the innermost MEM is
of the form (MEM (SYMBOL_REF sym)). It is assumed that the level to
- which these are valid is the same as spill_indirect_levels, above. */
+ which these are valid is the same as spill_indirect_levels, above. */
char indirect_symref_ok;
/* Nonzero if an address (plus (reg frame_pointer) (reg ...)) is valid. */
@@ -916,7 +916,7 @@ reload (first, global)
/* Round size of stack frame to stack_alignment_needed. This must be done
here because the stack size may be a part of the offset computation
for register elimination, and there might have been new stack slots
- created in the last iteration of this loop. */
+ created in the last iteration of this loop. */
if (cfun->stack_alignment_needed)
assign_stack_local (BLKmode, 0, cfun->stack_alignment_needed);
@@ -2041,7 +2041,7 @@ alter_reg (i, from_reg)
if (adjust != 0 || GET_MODE (x) != GET_MODE (regno_reg_rtx[i]))
x = adjust_address_nv (x, GET_MODE (regno_reg_rtx[i]), adjust);
- /* Save the stack slot for later. */
+ /* Save the stack slot for later. */
reg_equiv_memory_loc[i] = x;
}
}
@@ -2316,7 +2316,7 @@ eliminate_regs (x, mem_mode, insn)
whole instead of this little section as well as the backend issues. */
case PLUS:
/* If this is the sum of an eliminable register and a constant, rework
- the sum. */
+ the sum. */
if (GET_CODE (XEXP (x, 0)) == REG
&& REGNO (XEXP (x, 0)) < FIRST_PSEUDO_REGISTER
&& CONSTANT_P (XEXP (x, 1)))
@@ -6192,7 +6192,7 @@ emit_input_reload_insns (chain, rl, old, j)
/* If it is no cheaper to copy from OLDEQUIV into the
reload register than it would be to move from memory,
don't use it. Likewise, if we need a secondary register
- or memory. */
+ or memory. */
if (oldequiv != 0
&& ((REGNO_REG_CLASS (regno) != rl->class