Commit f27e6bb2 by Kazu Hirata Committed by Kazu Hirata

reorg.c: Fix formatting.

2000-10-18  Kazu Hirata  <kazu@hxi.com>

	* reorg.c: Fix formatting.

From-SVN: r36926
parent b054460b
...@@ -4,6 +4,8 @@ ...@@ -4,6 +4,8 @@
expander that is used when not optimizing. Output a tab after expander that is used when not optimizing. Output a tab after
each assembly insns. each assembly insns.
* reorg.c: Fix formatting.
2000-10-17 Joern Rennecke <amylaar@redhat.co.uk> 2000-10-17 Joern Rennecke <amylaar@redhat.co.uk>
* reload1.c (move2add_note_store): Check for simple * reload1.c (move2add_note_store): Check for simple
......
...@@ -140,7 +140,6 @@ Boston, MA 02111-1307, USA. */ ...@@ -140,7 +140,6 @@ Boston, MA 02111-1307, USA. */
#include "insn-attr.h" #include "insn-attr.h"
#include "resource.h" #include "resource.h"
#ifdef DELAY_SLOTS #ifdef DELAY_SLOTS
#define obstack_chunk_alloc xmalloc #define obstack_chunk_alloc xmalloc
...@@ -792,7 +791,6 @@ optimize_skip (insn) ...@@ -792,7 +791,6 @@ optimize_skip (insn)
} }
#endif #endif
/* Encode and return branch direction and prediction information for /* Encode and return branch direction and prediction information for
INSN assuming it will jump to LABEL. INSN assuming it will jump to LABEL.
...@@ -849,7 +847,7 @@ get_jump_flags (insn, label) ...@@ -849,7 +847,7 @@ get_jump_flags (insn, label)
break; break;
default: default:
abort(); abort ();
} }
} }
else else
...@@ -1135,7 +1133,7 @@ redirect_with_delay_slots_safe_p (jump, newlabel, seq) ...@@ -1135,7 +1133,7 @@ redirect_with_delay_slots_safe_p (jump, newlabel, seq)
? eligible_for_annul_true (jump, i - 1, ? eligible_for_annul_true (jump, i - 1,
XVECEXP (pat, 0, i), flags) : XVECEXP (pat, 0, i), flags) :
#endif #endif
eligible_for_delay (jump, i -1, XVECEXP (pat, 0, i), flags))) eligible_for_delay (jump, i - 1, XVECEXP (pat, 0, i), flags)))
break; break;
return (i == XVECLEN (pat, 0)); return (i == XVECLEN (pat, 0));
...@@ -1200,7 +1198,6 @@ check_annul_list_true_false (annul_true_p, delay_list) ...@@ -1200,7 +1198,6 @@ check_annul_list_true_false (annul_true_p, delay_list)
return 1; return 1;
} }
/* INSN branches to an insn whose pattern SEQ is a SEQUENCE. Given that /* INSN branches to an insn whose pattern SEQ is a SEQUENCE. Given that
the condition tested by INSN is CONDITION and the resources shown in the condition tested by INSN is CONDITION and the resources shown in
OTHER_NEEDED are needed after INSN, see whether INSN can take all the insns OTHER_NEEDED are needed after INSN, see whether INSN can take all the insns
...@@ -1427,7 +1424,6 @@ steal_delay_list_from_fallthrough (insn, condition, seq, ...@@ -1427,7 +1424,6 @@ steal_delay_list_from_fallthrough (insn, condition, seq,
return delay_list; return delay_list;
} }
/* Try merging insns starting at THREAD which match exactly the insns in /* Try merging insns starting at THREAD which match exactly the insns in
INSN's delay list. INSN's delay list.
...@@ -1464,7 +1460,7 @@ try_merge_delay_insns (insn, thread) ...@@ -1464,7 +1460,7 @@ try_merge_delay_insns (insn, thread)
will essentially disable this optimization. This method is somewhat of will essentially disable this optimization. This method is somewhat of
a kludge, but I don't see a better way.) */ a kludge, but I don't see a better way.) */
if (! annul_p) if (! annul_p)
for (i = 1 ; i < num_slots ; i++) for (i = 1 ; i < num_slots; i++)
if (XVECEXP (PATTERN (insn), 0, i)) if (XVECEXP (PATTERN (insn), 0, i))
mark_referenced_resources (XVECEXP (PATTERN (insn), 0, i), &needed, 1); mark_referenced_resources (XVECEXP (PATTERN (insn), 0, i), &needed, 1);
...@@ -1804,7 +1800,6 @@ redundant_insn (insn, target, delay_list) ...@@ -1804,7 +1800,6 @@ redundant_insn (insn, target, delay_list)
return 0; return 0;
} }
/* If the insn requiring the delay slot conflicts with INSN, we /* If the insn requiring the delay slot conflicts with INSN, we
must stop. */ must stop. */
if (insn_sets_resource_p (XVECEXP (pat, 0, 0), &needed, 1)) if (insn_sets_resource_p (XVECEXP (pat, 0, 0), &needed, 1))
...@@ -2439,7 +2434,7 @@ fill_simple_delay_slots (non_jumps_p) ...@@ -2439,7 +2434,7 @@ fill_simple_delay_slots (non_jumps_p)
SET_HARD_REG_BIT (needed.regs, STACK_POINTER_REGNUM); SET_HARD_REG_BIT (needed.regs, STACK_POINTER_REGNUM);
#ifdef EPILOGUE_USES #ifdef EPILOGUE_USES
for (i = 0; i <FIRST_PSEUDO_REGISTER; i++) for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
{ {
if (EPILOGUE_USES (i)) if (EPILOGUE_USES (i))
SET_HARD_REG_BIT (needed.regs, i); SET_HARD_REG_BIT (needed.regs, i);
...@@ -3471,7 +3466,8 @@ make_return_insns (first) ...@@ -3471,7 +3466,8 @@ make_return_insns (first)
? eligible_for_annul_true (jump_insn, i - 1, ? eligible_for_annul_true (jump_insn, i - 1,
XVECEXP (pat, 0, i), flags) : XVECEXP (pat, 0, i), flags) :
#endif #endif
eligible_for_delay (jump_insn, i -1, XVECEXP (pat, 0, i), flags))) eligible_for_delay (jump_insn, i - 1,
XVECEXP (pat, 0, i), flags)))
break; break;
} }
else else
......
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