mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-30 11:05:09 +08:00
varasm.c (output_constant_pool): Bring back 'done' label inside an appropriate #ifdef.
* varasm.c (output_constant_pool): Bring back 'done' label inside an appropriate #ifdef. * bitmap.c (bitmap_element_allocate): Wrap variable 'i' in an appropriate #ifdef. (bitmap_copy, bitmap_operation): Likewise. * combine.c (combinable_i3pat): Similarly for 'src'. * function.c (fixup_var_refs_1): Similarly for 'outerdest'. (locate_and_pad_parm): Similarly for 'reg_parm_stack_space'. * regclass.c (copy_cost): Similarly for 'secondary_class'. * reload.c (make_memloc): Simliarly for 'i'. (find_reloads_address_1): Similarly for 'link'. * reload1.c (reload): Similarly for 'previous_frame_pointer_needed'. (emit_reload_insns): Similarly for 'second_reloadreg'. * unroll.c (iteration_info): Similarly for 'v'. * caller-save.c (insert_save_restore): Remove unused variable 'i'. * calls.c (expand_call): Similarly for 'i'. (emit_library_call, emit_library_call_value): Similarly for 'mode'. * fold-const.c (strip_compund_expr): Similarly for 'type'. * function.c (fixup_var_refs_1): Similarly for 'width'. (fixup_memory_subreg): Similarly for 'saved'. (locate_and_pad_parm): Similarly for 'boundary_in_bytes.' (setjmp_protect): Similarly for 'sub'. (thread_prologue_and_epilogue_insns): Similarly for 'insn'. * loop.c (record_giv): Similarly for 'p'. (combine_givs): Similarly for 'temp_iv'. (indirect_jump_in_function_p): Similarly for 'is_indirect_jump'. * recog.c (validate_replace_rtx_1): Similarly for 'width'. * tree.c (get_set_constructor_bytes): Similarly for 'vals'. * unroll.c (unroll_loop): Similarly for 'copy'. (iteration_info): Similarly for 'b'. * varasm.c (assemble_string): Similarly for 'i'. * i386.h (LEGITIMIZE_ADDRESS): Similarly for 'orig_x'. From-SVN: r17973
This commit is contained in:
parent
bfd5e22089
commit
29a820586a
@ -1,3 +1,40 @@
|
||||
Sat Feb 14 02:02:41 1998 Jeffrey A Law (law@cygnus.com)
|
||||
|
||||
* varasm.c (output_constant_pool): Bring back 'done' label inside
|
||||
an appropriate #ifdef.
|
||||
|
||||
* bitmap.c (bitmap_element_allocate): Wrap variable 'i' in an
|
||||
appropriate #ifdef.
|
||||
(bitmap_copy, bitmap_operation): Likewise.
|
||||
* combine.c (combinable_i3pat): Similarly for 'src'.
|
||||
* function.c (fixup_var_refs_1): Similarly for 'outerdest'.
|
||||
(locate_and_pad_parm): Similarly for 'reg_parm_stack_space'.
|
||||
* regclass.c (copy_cost): Similarly for 'secondary_class'.
|
||||
* reload.c (make_memloc): Simliarly for 'i'.
|
||||
(find_reloads_address_1): Similarly for 'link'.
|
||||
* reload1.c (reload): Similarly for 'previous_frame_pointer_needed'.
|
||||
(emit_reload_insns): Similarly for 'second_reloadreg'.
|
||||
* unroll.c (iteration_info): Similarly for 'v'.
|
||||
|
||||
* caller-save.c (insert_save_restore): Remove unused variable 'i'.
|
||||
* calls.c (expand_call): Similarly for 'i'.
|
||||
(emit_library_call, emit_library_call_value): Similarly for 'mode'.
|
||||
* fold-const.c (strip_compund_expr): Similarly for 'type'.
|
||||
* function.c (fixup_var_refs_1): Similarly for 'width'.
|
||||
(fixup_memory_subreg): Similarly for 'saved'.
|
||||
(locate_and_pad_parm): Similarly for 'boundary_in_bytes.'
|
||||
(setjmp_protect): Similarly for 'sub'.
|
||||
(thread_prologue_and_epilogue_insns): Similarly for 'insn'.
|
||||
* loop.c (record_giv): Similarly for 'p'.
|
||||
(combine_givs): Similarly for 'temp_iv'.
|
||||
(indirect_jump_in_function_p): Similarly for 'is_indirect_jump'.
|
||||
* recog.c (validate_replace_rtx_1): Similarly for 'width'.
|
||||
* tree.c (get_set_constructor_bytes): Similarly for 'vals'.
|
||||
* unroll.c (unroll_loop): Similarly for 'copy'.
|
||||
(iteration_info): Similarly for 'b'.
|
||||
* varasm.c (assemble_string): Similarly for 'i'.
|
||||
* i386.h (LEGITIMIZE_ADDRESS): Similarly for 'orig_x'.
|
||||
|
||||
Fri Feb 13 14:38:34 1998 Jim Wilson <wilson@cygnus.com>
|
||||
|
||||
* dwarf2out.c (decl_scope_node): New type.
|
||||
|
@ -92,7 +92,9 @@ bitmap_element_allocate (head)
|
||||
bitmap head;
|
||||
{
|
||||
bitmap_element *element;
|
||||
#if BITMAP_ELEMENT_WORDS != 2
|
||||
int i;
|
||||
#endif
|
||||
|
||||
if (bitmap_free != 0)
|
||||
{
|
||||
@ -246,7 +248,9 @@ bitmap_copy (to, from)
|
||||
bitmap from;
|
||||
{
|
||||
bitmap_element *from_ptr, *to_ptr = 0;
|
||||
#if BITMAP_ELEMENT_WORDS != 2
|
||||
int i;
|
||||
#endif
|
||||
|
||||
bitmap_clear (to);
|
||||
|
||||
@ -413,7 +417,9 @@ bitmap_operation (to, from1, from2, operation)
|
||||
bitmap_element *from1_tmp;
|
||||
bitmap_element *from2_tmp;
|
||||
unsigned int indx;
|
||||
#if BITMAP_ELEMENT_WORDS != 2
|
||||
int i;
|
||||
#endif
|
||||
|
||||
/* To simplify things, always create a new list. If the old list was one
|
||||
of the inputs, free it later. Otherwise, free it now. */
|
||||
|
@ -1,5 +1,5 @@
|
||||
/* Save and restore call-clobbered registers which are live across a call.
|
||||
Copyright (C) 1989, 1992, 1994, 1995, 1997 Free Software Foundation, Inc.
|
||||
Copyright (C) 1989, 1992, 94-95, 1997, 1998 Free Software Foundation, Inc.
|
||||
|
||||
This file is part of GNU CC.
|
||||
|
||||
@ -642,7 +642,7 @@ insert_save_restore (insn, save_p, regno, insn_mode, maxrestore)
|
||||
{
|
||||
rtx pat;
|
||||
enum insn_code code;
|
||||
int i, numregs;
|
||||
int numregs;
|
||||
|
||||
/* A common failure mode if register status is not correct in the RTL
|
||||
is for this routine to be called with a REGNO we didn't expect to
|
||||
|
@ -2110,7 +2110,6 @@ expand_call (exp, target, ignore)
|
||||
Deal with them explicitly by copying from the return registers
|
||||
into the target MEM locations. */
|
||||
int bytes = int_size_in_bytes (TREE_TYPE (exp));
|
||||
int i;
|
||||
rtx src, dst;
|
||||
int bitsize = MIN (TYPE_ALIGN (TREE_TYPE (exp)), BITS_PER_WORD);
|
||||
int bitpos, xbitpos, big_endian_correction = 0;
|
||||
@ -2696,7 +2695,6 @@ emit_library_call VPROTO((rtx orgfun, int no_queue, enum machine_mode outmode,
|
||||
are to be pushed. */
|
||||
for (count = 0; count < nargs; count++, argnum += inc)
|
||||
{
|
||||
register enum machine_mode mode = argvec[argnum].mode;
|
||||
register rtx val = argvec[argnum].value;
|
||||
rtx reg = argvec[argnum].reg;
|
||||
int partial = argvec[argnum].partial;
|
||||
@ -3272,7 +3270,6 @@ emit_library_call_value VPROTO((rtx orgfun, rtx value, int no_queue,
|
||||
are to be pushed. */
|
||||
for (count = 0; count < nargs; count++, argnum += inc)
|
||||
{
|
||||
register enum machine_mode mode = argvec[argnum].mode;
|
||||
register rtx val = argvec[argnum].value;
|
||||
rtx reg = argvec[argnum].reg;
|
||||
int partial = argvec[argnum].partial;
|
||||
|
@ -1198,7 +1198,11 @@ combinable_i3pat (i3, loc, i2dest, i1dest, i1_not_in_src, pi3dest_killed)
|
||||
rtx set = expand_field_assignment (x);
|
||||
rtx dest = SET_DEST (set);
|
||||
rtx src = SET_SRC (set);
|
||||
rtx inner_dest = dest, inner_src = src;
|
||||
rtx inner_dest = dest;
|
||||
|
||||
#if 0
|
||||
rtx inner_src = src;
|
||||
#endif
|
||||
|
||||
SUBST (*loc, set);
|
||||
|
||||
|
@ -1670,7 +1670,6 @@ do { \
|
||||
|
||||
#define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
|
||||
{ \
|
||||
rtx orig_x = (X); \
|
||||
(X) = legitimize_address (X, OLDX, MODE); \
|
||||
if (memory_address_p (MODE, X)) \
|
||||
goto WIN; \
|
||||
|
@ -3664,7 +3664,6 @@ strip_compound_expr (t, s)
|
||||
tree t;
|
||||
tree s;
|
||||
{
|
||||
tree type = TREE_TYPE (t);
|
||||
enum tree_code code = TREE_CODE (t);
|
||||
|
||||
/* See if this is the COMPOUND_EXPR we want to eliminate. */
|
||||
|
@ -1849,7 +1849,6 @@ fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements)
|
||||
{
|
||||
enum machine_mode wanted_mode = VOIDmode;
|
||||
enum machine_mode is_mode = GET_MODE (tem);
|
||||
int width = INTVAL (XEXP (x, 1));
|
||||
int pos = INTVAL (XEXP (x, 2));
|
||||
|
||||
#ifdef HAVE_extzv
|
||||
@ -1998,7 +1997,9 @@ fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements)
|
||||
{
|
||||
rtx dest = SET_DEST (x);
|
||||
rtx src = SET_SRC (x);
|
||||
#ifdef HAVE_insv
|
||||
rtx outerdest = dest;
|
||||
#endif
|
||||
|
||||
while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
|
||||
|| GET_CODE (dest) == SIGN_EXTRACT
|
||||
@ -2268,7 +2269,7 @@ fixup_memory_subreg (x, insn, uncritical)
|
||||
int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
|
||||
rtx addr = XEXP (SUBREG_REG (x), 0);
|
||||
enum machine_mode mode = GET_MODE (x);
|
||||
rtx saved, result;
|
||||
rtx result;
|
||||
|
||||
/* Paradoxical SUBREGs are usually invalid during RTL generation. */
|
||||
if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))
|
||||
@ -4483,14 +4484,14 @@ locate_and_pad_parm (passed_mode, type, in_regs, fndecl,
|
||||
= type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
|
||||
enum direction where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
|
||||
int boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
|
||||
int boundary_in_bytes = boundary / BITS_PER_UNIT;
|
||||
int reg_parm_stack_space = 0;
|
||||
|
||||
#ifdef REG_PARM_STACK_SPACE
|
||||
/* If we have found a stack parm before we reach the end of the
|
||||
area reserved for registers, skip that area. */
|
||||
if (! in_regs)
|
||||
{
|
||||
int reg_parm_stack_space = 0;
|
||||
|
||||
#ifdef MAYBE_REG_PARM_STACK_SPACE
|
||||
reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
|
||||
#else
|
||||
@ -4732,7 +4733,7 @@ setjmp_protect (block)
|
||||
void
|
||||
setjmp_protect_args ()
|
||||
{
|
||||
register tree decl, sub;
|
||||
register tree decl;
|
||||
for (decl = DECL_ARGUMENTS (current_function_decl);
|
||||
decl; decl = TREE_CHAIN (decl))
|
||||
if ((TREE_CODE (decl) == VAR_DECL
|
||||
@ -5893,7 +5894,7 @@ thread_prologue_and_epilogue_insns (f)
|
||||
#ifdef HAVE_prologue
|
||||
if (HAVE_prologue)
|
||||
{
|
||||
rtx head, seq, insn;
|
||||
rtx head, seq;
|
||||
|
||||
/* The first insn (a NOTE_INSN_DELETED) is followed by zero or more
|
||||
prologue insns and a NOTE_INSN_PROLOGUE_END. */
|
||||
|
@ -4659,7 +4659,6 @@ record_giv (v, insn, src_reg, dest_reg, mult_val, add_val, benefit,
|
||||
struct induction *b;
|
||||
struct iv_class *bl;
|
||||
rtx set = single_set (insn);
|
||||
rtx p;
|
||||
|
||||
v->insn = insn;
|
||||
v->src_reg = src_reg;
|
||||
@ -5836,7 +5835,7 @@ static void
|
||||
combine_givs (bl)
|
||||
struct iv_class *bl;
|
||||
{
|
||||
struct induction *g1, *g2, **giv_array, *temp_iv;
|
||||
struct induction *g1, *g2, **giv_array;
|
||||
int i, j, giv_count, pass;
|
||||
|
||||
/* Count givs, because bl->giv_count is incorrect here. */
|
||||
@ -7682,7 +7681,6 @@ indirect_jump_in_function_p (start)
|
||||
rtx start;
|
||||
{
|
||||
rtx insn;
|
||||
int is_indirect_jump = 0;
|
||||
|
||||
for (insn = start; insn; insn = NEXT_INSN (insn))
|
||||
if (computed_jump_p (insn))
|
||||
|
@ -1,5 +1,5 @@
|
||||
/* Subroutines used by or related to instruction recognition.
|
||||
Copyright (C) 1987, 1988, 91-6, 1997 Free Software Foundation, Inc.
|
||||
Copyright (C) 1987, 1988, 91-97, 1998 Free Software Foundation, Inc.
|
||||
|
||||
This file is part of GNU CC.
|
||||
|
||||
@ -466,7 +466,6 @@ validate_replace_rtx_1 (loc, from, to, object)
|
||||
{
|
||||
enum machine_mode wanted_mode = VOIDmode;
|
||||
enum machine_mode is_mode = GET_MODE (to);
|
||||
int width = INTVAL (XEXP (x, 1));
|
||||
int pos = INTVAL (XEXP (x, 2));
|
||||
|
||||
#ifdef HAVE_extzv
|
||||
|
@ -1,5 +1,5 @@
|
||||
/* Compute register class preferences for pseudo-registers.
|
||||
Copyright (C) 1987, 88, 91-96, 1997 Free Software Foundation, Inc.
|
||||
Copyright (C) 1987, 88, 91-97, 1998 Free Software Foundation, Inc.
|
||||
|
||||
This file is part of GNU CC.
|
||||
|
||||
@ -1408,7 +1408,9 @@ copy_cost (x, mode, class, to_p)
|
||||
enum reg_class class;
|
||||
int to_p;
|
||||
{
|
||||
#ifdef HAVE_SECONDARY_RELOADS
|
||||
enum reg_class secondary_class = NO_REGS;
|
||||
#endif
|
||||
|
||||
/* If X is a SCRATCH, there is actually nothing to move since we are
|
||||
assuming optimal allocation. */
|
||||
|
@ -4256,7 +4256,9 @@ make_memloc (ad, regno)
|
||||
rtx ad;
|
||||
int regno;
|
||||
{
|
||||
#if 0
|
||||
register int i;
|
||||
#endif
|
||||
/* We must rerun eliminate_regs, in case the elimination
|
||||
offsets have changed. */
|
||||
rtx tem = XEXP (eliminate_regs (reg_equiv_memory_loc[regno], 0, NULL_RTX), 0);
|
||||
@ -4968,7 +4970,9 @@ find_reloads_address_1 (mode, x, context, loc, opnum, type, ind_levels, insn)
|
||||
|| !(context ? REGNO_OK_FOR_INDEX_P (regno)
|
||||
: REGNO_MODE_OK_FOR_BASE_P (regno, mode))))
|
||||
{
|
||||
#ifdef AUTO_INC_DEC
|
||||
register rtx link;
|
||||
#endif
|
||||
int reloadnum;
|
||||
|
||||
/* If we can output the register afterwards, do so, this
|
||||
|
@ -890,7 +890,9 @@ reload (first, global, dumpfile)
|
||||
rtx max_nongroups_insn[N_REG_CLASSES];
|
||||
rtx x;
|
||||
HOST_WIDE_INT starting_frame_size;
|
||||
#if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
|
||||
int previous_frame_pointer_needed = frame_pointer_needed;
|
||||
#endif
|
||||
static char *reg_class_names[] = REG_CLASS_NAMES;
|
||||
|
||||
something_changed = 0;
|
||||
@ -6600,7 +6602,9 @@ emit_reload_insns (insn)
|
||||
&& reload_reg_rtx[j] != 0)
|
||||
{
|
||||
register rtx reloadreg = reload_reg_rtx[j];
|
||||
#ifdef SECONDARY_OUTPUT_RELOAD_CLASS
|
||||
register rtx second_reloadreg = 0;
|
||||
#endif
|
||||
rtx note, p;
|
||||
enum machine_mode mode;
|
||||
int special = 0;
|
||||
|
@ -1,5 +1,5 @@
|
||||
/* Language-independent node constructors for parse phase of GNU compiler.
|
||||
Copyright (C) 1987, 88, 92-96, 1997 Free Software Foundation, Inc.
|
||||
Copyright (C) 1987, 88, 92-97, 1998 Free Software Foundation, Inc.
|
||||
|
||||
This file is part of GNU CC.
|
||||
|
||||
@ -4796,7 +4796,6 @@ get_set_constructor_bytes (init, buffer, wd_size)
|
||||
int wd_size;
|
||||
{
|
||||
int i;
|
||||
tree vals = TREE_OPERAND (init, 1);
|
||||
int set_word_size = BITS_PER_UNIT;
|
||||
int bit_size = wd_size * set_word_size;
|
||||
int bit_pos = 0;
|
||||
|
@ -1,5 +1,5 @@
|
||||
/* Try to unroll loops, and split induction variables.
|
||||
Copyright (C) 1992, 1993, 1994, 1995, 1997 Free Software Foundation, Inc.
|
||||
Copyright (C) 1992, 93-95, 1997, 1998 Free Software Foundation, Inc.
|
||||
Contributed by James E. Wilson, Cygnus Support/UC Berkeley.
|
||||
|
||||
This file is part of GNU CC.
|
||||
@ -235,7 +235,7 @@ unroll_loop (loop_end, insn_count, loop_start, end_insert_before,
|
||||
int i, j, temp;
|
||||
int unroll_number = 1;
|
||||
rtx copy_start, copy_end;
|
||||
rtx insn, copy, sequence, pattern, tem;
|
||||
rtx insn, sequence, pattern, tem;
|
||||
int max_labelno, max_insnno;
|
||||
rtx insert_before;
|
||||
struct inline_remap *map;
|
||||
@ -2309,7 +2309,9 @@ iteration_info (iteration_var, initial_value, increment, loop_start, loop_end)
|
||||
rtx loop_start, loop_end;
|
||||
{
|
||||
struct iv_class *bl;
|
||||
struct induction *v, *b;
|
||||
#if 0
|
||||
struct induction *v;
|
||||
#endif
|
||||
|
||||
/* Clear the result values, in case no answer can be found. */
|
||||
*initial_value = 0;
|
||||
|
@ -1073,7 +1073,6 @@ assemble_string (p, size)
|
||||
char *p;
|
||||
int size;
|
||||
{
|
||||
register int i;
|
||||
int pos = 0;
|
||||
int maximum = 2000;
|
||||
|
||||
@ -3537,6 +3536,10 @@ output_constant_pool (fnname, fndecl)
|
||||
|
||||
}
|
||||
|
||||
#ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
|
||||
done: ;
|
||||
#endif
|
||||
|
||||
#ifdef ASM_OUTPUT_POOL_EPILOGUE
|
||||
ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
|
||||
#endif
|
||||
|
Loading…
Reference in New Issue
Block a user