/* Convert RTL to assembler code and output it, for GNU compiler.
|
/* Convert RTL to assembler code and output it, for GNU compiler.
|
Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
|
Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
|
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
GCC is free software; you can redistribute it and/or modify it under
|
the terms of the GNU General Public License as published by the Free
|
the terms of the GNU General Public License as published by the Free
|
Software Foundation; either version 3, or (at your option) any later
|
Software Foundation; either version 3, or (at your option) any later
|
version.
|
version.
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
for more details.
|
for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
/* This is the final pass of the compiler.
|
/* This is the final pass of the compiler.
|
It looks at the rtl code for a function and outputs assembler code.
|
It looks at the rtl code for a function and outputs assembler code.
|
|
|
Call `final_start_function' to output the assembler code for function entry,
|
Call `final_start_function' to output the assembler code for function entry,
|
`final' to output assembler code for some RTL code,
|
`final' to output assembler code for some RTL code,
|
`final_end_function' to output assembler code for function exit.
|
`final_end_function' to output assembler code for function exit.
|
If a function is compiled in several pieces, each piece is
|
If a function is compiled in several pieces, each piece is
|
output separately with `final'.
|
output separately with `final'.
|
|
|
Some optimizations are also done at this level.
|
Some optimizations are also done at this level.
|
Move instructions that were made unnecessary by good register allocation
|
Move instructions that were made unnecessary by good register allocation
|
are detected and omitted from the output. (Though most of these
|
are detected and omitted from the output. (Though most of these
|
are removed by the last jump pass.)
|
are removed by the last jump pass.)
|
|
|
Instructions to set the condition codes are omitted when it can be
|
Instructions to set the condition codes are omitted when it can be
|
seen that the condition codes already had the desired values.
|
seen that the condition codes already had the desired values.
|
|
|
In some cases it is sufficient if the inherited condition codes
|
In some cases it is sufficient if the inherited condition codes
|
have related values, but this may require the following insn
|
have related values, but this may require the following insn
|
(the one that tests the condition codes) to be modified.
|
(the one that tests the condition codes) to be modified.
|
|
|
The code for the function prologue and epilogue are generated
|
The code for the function prologue and epilogue are generated
|
directly in assembler by the target functions function_prologue and
|
directly in assembler by the target functions function_prologue and
|
function_epilogue. Those instructions never exist as rtl. */
|
function_epilogue. Those instructions never exist as rtl. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
|
|
#include "tree.h"
|
#include "tree.h"
|
#include "rtl.h"
|
#include "rtl.h"
|
#include "tm_p.h"
|
#include "tm_p.h"
|
#include "regs.h"
|
#include "regs.h"
|
#include "insn-config.h"
|
#include "insn-config.h"
|
#include "insn-attr.h"
|
#include "insn-attr.h"
|
#include "recog.h"
|
#include "recog.h"
|
#include "conditions.h"
|
#include "conditions.h"
|
#include "flags.h"
|
#include "flags.h"
|
#include "real.h"
|
#include "real.h"
|
#include "hard-reg-set.h"
|
#include "hard-reg-set.h"
|
#include "output.h"
|
#include "output.h"
|
#include "except.h"
|
#include "except.h"
|
#include "function.h"
|
#include "function.h"
|
#include "toplev.h"
|
#include "toplev.h"
|
#include "reload.h"
|
#include "reload.h"
|
#include "intl.h"
|
#include "intl.h"
|
#include "basic-block.h"
|
#include "basic-block.h"
|
#include "target.h"
|
#include "target.h"
|
#include "debug.h"
|
#include "debug.h"
|
#include "expr.h"
|
#include "expr.h"
|
#include "cfglayout.h"
|
#include "cfglayout.h"
|
#include "tree-pass.h"
|
#include "tree-pass.h"
|
#include "timevar.h"
|
#include "timevar.h"
|
#include "cgraph.h"
|
#include "cgraph.h"
|
#include "coverage.h"
|
#include "coverage.h"
|
|
|
#ifdef XCOFF_DEBUGGING_INFO
|
#ifdef XCOFF_DEBUGGING_INFO
|
#include "xcoffout.h" /* Needed for external data
|
#include "xcoffout.h" /* Needed for external data
|
declarations for e.g. AIX 4.x. */
|
declarations for e.g. AIX 4.x. */
|
#endif
|
#endif
|
|
|
#if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
|
#if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
|
#include "dwarf2out.h"
|
#include "dwarf2out.h"
|
#endif
|
#endif
|
|
|
#ifdef DBX_DEBUGGING_INFO
|
#ifdef DBX_DEBUGGING_INFO
|
#include "dbxout.h"
|
#include "dbxout.h"
|
#endif
|
#endif
|
|
|
#ifdef SDB_DEBUGGING_INFO
|
#ifdef SDB_DEBUGGING_INFO
|
#include "sdbout.h"
|
#include "sdbout.h"
|
#endif
|
#endif
|
|
|
/* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
|
/* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
|
null default for it to save conditionalization later. */
|
null default for it to save conditionalization later. */
|
#ifndef CC_STATUS_INIT
|
#ifndef CC_STATUS_INIT
|
#define CC_STATUS_INIT
|
#define CC_STATUS_INIT
|
#endif
|
#endif
|
|
|
/* How to start an assembler comment. */
|
/* How to start an assembler comment. */
|
#ifndef ASM_COMMENT_START
|
#ifndef ASM_COMMENT_START
|
#define ASM_COMMENT_START ";#"
|
#define ASM_COMMENT_START ";#"
|
#endif
|
#endif
|
|
|
/* Is the given character a logical line separator for the assembler? */
|
/* Is the given character a logical line separator for the assembler? */
|
#ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
|
#ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
|
#define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
|
#define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
|
#endif
|
#endif
|
|
|
#ifndef JUMP_TABLES_IN_TEXT_SECTION
|
#ifndef JUMP_TABLES_IN_TEXT_SECTION
|
#define JUMP_TABLES_IN_TEXT_SECTION 0
|
#define JUMP_TABLES_IN_TEXT_SECTION 0
|
#endif
|
#endif
|
|
|
/* Bitflags used by final_scan_insn. */
|
/* Bitflags used by final_scan_insn. */
|
#define SEEN_BB 1
|
#define SEEN_BB 1
|
#define SEEN_NOTE 2
|
#define SEEN_NOTE 2
|
#define SEEN_EMITTED 4
|
#define SEEN_EMITTED 4
|
|
|
/* Last insn processed by final_scan_insn. */
|
/* Last insn processed by final_scan_insn. */
|
static rtx debug_insn;
|
static rtx debug_insn;
|
rtx current_output_insn;
|
rtx current_output_insn;
|
|
|
/* Line number of last NOTE. */
|
/* Line number of last NOTE. */
|
static int last_linenum;
|
static int last_linenum;
|
|
|
/* Highest line number in current block. */
|
/* Highest line number in current block. */
|
static int high_block_linenum;
|
static int high_block_linenum;
|
|
|
/* Likewise for function. */
|
/* Likewise for function. */
|
static int high_function_linenum;
|
static int high_function_linenum;
|
|
|
/* Filename of last NOTE. */
|
/* Filename of last NOTE. */
|
static const char *last_filename;
|
static const char *last_filename;
|
|
|
/* Whether to force emission of a line note before the next insn. */
|
/* Whether to force emission of a line note before the next insn. */
|
static bool force_source_line = false;
|
static bool force_source_line = false;
|
|
|
extern const int length_unit_log; /* This is defined in insn-attrtab.c. */
|
extern const int length_unit_log; /* This is defined in insn-attrtab.c. */
|
|
|
/* Nonzero while outputting an `asm' with operands.
|
/* Nonzero while outputting an `asm' with operands.
|
This means that inconsistencies are the user's fault, so don't die.
|
This means that inconsistencies are the user's fault, so don't die.
|
The precise value is the insn being output, to pass to error_for_asm. */
|
The precise value is the insn being output, to pass to error_for_asm. */
|
rtx this_is_asm_operands;
|
rtx this_is_asm_operands;
|
|
|
/* Number of operands of this insn, for an `asm' with operands. */
|
/* Number of operands of this insn, for an `asm' with operands. */
|
static unsigned int insn_noperands;
|
static unsigned int insn_noperands;
|
|
|
/* Compare optimization flag. */
|
/* Compare optimization flag. */
|
|
|
static rtx last_ignored_compare = 0;
|
static rtx last_ignored_compare = 0;
|
|
|
/* Assign a unique number to each insn that is output.
|
/* Assign a unique number to each insn that is output.
|
This can be used to generate unique local labels. */
|
This can be used to generate unique local labels. */
|
|
|
static int insn_counter = 0;
|
static int insn_counter = 0;
|
|
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
/* This variable contains machine-dependent flags (defined in tm.h)
|
/* This variable contains machine-dependent flags (defined in tm.h)
|
set and examined by output routines
|
set and examined by output routines
|
that describe how to interpret the condition codes properly. */
|
that describe how to interpret the condition codes properly. */
|
|
|
CC_STATUS cc_status;
|
CC_STATUS cc_status;
|
|
|
/* During output of an insn, this contains a copy of cc_status
|
/* During output of an insn, this contains a copy of cc_status
|
from before the insn. */
|
from before the insn. */
|
|
|
CC_STATUS cc_prev_status;
|
CC_STATUS cc_prev_status;
|
#endif
|
#endif
|
|
|
/* Indexed by hardware reg number, is 1 if that register is ever
|
/* Indexed by hardware reg number, is 1 if that register is ever
|
used in the current function.
|
used in the current function.
|
|
|
In life_analysis, or in stupid_life_analysis, this is set
|
In life_analysis, or in stupid_life_analysis, this is set
|
up to record the hard regs used explicitly. Reload adds
|
up to record the hard regs used explicitly. Reload adds
|
in the hard regs used for holding pseudo regs. Final uses
|
in the hard regs used for holding pseudo regs. Final uses
|
it to generate the code in the function prologue and epilogue
|
it to generate the code in the function prologue and epilogue
|
to save and restore registers as needed. */
|
to save and restore registers as needed. */
|
|
|
char regs_ever_live[FIRST_PSEUDO_REGISTER];
|
char regs_ever_live[FIRST_PSEUDO_REGISTER];
|
|
|
/* Like regs_ever_live, but 1 if a reg is set or clobbered from an asm.
|
/* Like regs_ever_live, but 1 if a reg is set or clobbered from an asm.
|
Unlike regs_ever_live, elements of this array corresponding to
|
Unlike regs_ever_live, elements of this array corresponding to
|
eliminable regs like the frame pointer are set if an asm sets them. */
|
eliminable regs like the frame pointer are set if an asm sets them. */
|
|
|
char regs_asm_clobbered[FIRST_PSEUDO_REGISTER];
|
char regs_asm_clobbered[FIRST_PSEUDO_REGISTER];
|
|
|
/* Nonzero means current function must be given a frame pointer.
|
/* Nonzero means current function must be given a frame pointer.
|
Initialized in function.c to 0. Set only in reload1.c as per
|
Initialized in function.c to 0. Set only in reload1.c as per
|
the needs of the function. */
|
the needs of the function. */
|
|
|
int frame_pointer_needed;
|
int frame_pointer_needed;
|
|
|
/* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
|
/* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
|
|
|
static int block_depth;
|
static int block_depth;
|
|
|
/* Nonzero if have enabled APP processing of our assembler output. */
|
/* Nonzero if have enabled APP processing of our assembler output. */
|
|
|
static int app_on;
|
static int app_on;
|
|
|
/* If we are outputting an insn sequence, this contains the sequence rtx.
|
/* If we are outputting an insn sequence, this contains the sequence rtx.
|
Zero otherwise. */
|
Zero otherwise. */
|
|
|
rtx final_sequence;
|
rtx final_sequence;
|
|
|
#ifdef ASSEMBLER_DIALECT
|
#ifdef ASSEMBLER_DIALECT
|
|
|
/* Number of the assembler dialect to use, starting at 0. */
|
/* Number of the assembler dialect to use, starting at 0. */
|
static int dialect_number;
|
static int dialect_number;
|
#endif
|
#endif
|
|
|
#ifdef HAVE_conditional_execution
|
#ifdef HAVE_conditional_execution
|
/* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
|
/* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
|
rtx current_insn_predicate;
|
rtx current_insn_predicate;
|
#endif
|
#endif
|
|
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
static int asm_insn_count (rtx);
|
static int asm_insn_count (rtx);
|
#endif
|
#endif
|
static void profile_function (FILE *);
|
static void profile_function (FILE *);
|
static void profile_after_prologue (FILE *);
|
static void profile_after_prologue (FILE *);
|
static bool notice_source_line (rtx);
|
static bool notice_source_line (rtx);
|
static rtx walk_alter_subreg (rtx *);
|
static rtx walk_alter_subreg (rtx *);
|
static void output_asm_name (void);
|
static void output_asm_name (void);
|
static void output_alternate_entry_point (FILE *, rtx);
|
static void output_alternate_entry_point (FILE *, rtx);
|
static tree get_mem_expr_from_op (rtx, int *);
|
static tree get_mem_expr_from_op (rtx, int *);
|
static void output_asm_operand_names (rtx *, int *, int);
|
static void output_asm_operand_names (rtx *, int *, int);
|
static void output_operand (rtx, int);
|
static void output_operand (rtx, int);
|
#ifdef LEAF_REGISTERS
|
#ifdef LEAF_REGISTERS
|
static void leaf_renumber_regs (rtx);
|
static void leaf_renumber_regs (rtx);
|
#endif
|
#endif
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
static int alter_cond (rtx);
|
static int alter_cond (rtx);
|
#endif
|
#endif
|
#ifndef ADDR_VEC_ALIGN
|
#ifndef ADDR_VEC_ALIGN
|
static int final_addr_vec_align (rtx);
|
static int final_addr_vec_align (rtx);
|
#endif
|
#endif
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
static int align_fuzz (rtx, rtx, int, unsigned);
|
static int align_fuzz (rtx, rtx, int, unsigned);
|
#endif
|
#endif
|
|
|
/* Initialize data in final at the beginning of a compilation. */
|
/* Initialize data in final at the beginning of a compilation. */
|
|
|
void
|
void
|
init_final (const char *filename ATTRIBUTE_UNUSED)
|
init_final (const char *filename ATTRIBUTE_UNUSED)
|
{
|
{
|
app_on = 0;
|
app_on = 0;
|
final_sequence = 0;
|
final_sequence = 0;
|
|
|
#ifdef ASSEMBLER_DIALECT
|
#ifdef ASSEMBLER_DIALECT
|
dialect_number = ASSEMBLER_DIALECT;
|
dialect_number = ASSEMBLER_DIALECT;
|
#endif
|
#endif
|
}
|
}
|
|
|
/* Default target function prologue and epilogue assembler output.
|
/* Default target function prologue and epilogue assembler output.
|
|
|
If not overridden for epilogue code, then the function body itself
|
If not overridden for epilogue code, then the function body itself
|
contains return instructions wherever needed. */
|
contains return instructions wherever needed. */
|
void
|
void
|
default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED,
|
default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED,
|
HOST_WIDE_INT size ATTRIBUTE_UNUSED)
|
HOST_WIDE_INT size ATTRIBUTE_UNUSED)
|
{
|
{
|
}
|
}
|
|
|
/* Default target hook that outputs nothing to a stream. */
|
/* Default target hook that outputs nothing to a stream. */
|
void
|
void
|
no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED)
|
no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED)
|
{
|
{
|
}
|
}
|
|
|
/* Enable APP processing of subsequent output.
|
/* Enable APP processing of subsequent output.
|
Used before the output from an `asm' statement. */
|
Used before the output from an `asm' statement. */
|
|
|
void
|
void
|
app_enable (void)
|
app_enable (void)
|
{
|
{
|
if (! app_on)
|
if (! app_on)
|
{
|
{
|
fputs (ASM_APP_ON, asm_out_file);
|
fputs (ASM_APP_ON, asm_out_file);
|
app_on = 1;
|
app_on = 1;
|
}
|
}
|
}
|
}
|
|
|
/* Disable APP processing of subsequent output.
|
/* Disable APP processing of subsequent output.
|
Called from varasm.c before most kinds of output. */
|
Called from varasm.c before most kinds of output. */
|
|
|
void
|
void
|
app_disable (void)
|
app_disable (void)
|
{
|
{
|
if (app_on)
|
if (app_on)
|
{
|
{
|
fputs (ASM_APP_OFF, asm_out_file);
|
fputs (ASM_APP_OFF, asm_out_file);
|
app_on = 0;
|
app_on = 0;
|
}
|
}
|
}
|
}
|
|
|
/* Return the number of slots filled in the current
|
/* Return the number of slots filled in the current
|
delayed branch sequence (we don't count the insn needing the
|
delayed branch sequence (we don't count the insn needing the
|
delay slot). Zero if not in a delayed branch sequence. */
|
delay slot). Zero if not in a delayed branch sequence. */
|
|
|
#ifdef DELAY_SLOTS
|
#ifdef DELAY_SLOTS
|
int
|
int
|
dbr_sequence_length (void)
|
dbr_sequence_length (void)
|
{
|
{
|
if (final_sequence != 0)
|
if (final_sequence != 0)
|
return XVECLEN (final_sequence, 0) - 1;
|
return XVECLEN (final_sequence, 0) - 1;
|
else
|
else
|
return 0;
|
return 0;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* The next two pages contain routines used to compute the length of an insn
|
/* The next two pages contain routines used to compute the length of an insn
|
and to shorten branches. */
|
and to shorten branches. */
|
|
|
/* Arrays for insn lengths, and addresses. The latter is referenced by
|
/* Arrays for insn lengths, and addresses. The latter is referenced by
|
`insn_current_length'. */
|
`insn_current_length'. */
|
|
|
static int *insn_lengths;
|
static int *insn_lengths;
|
|
|
varray_type insn_addresses_;
|
varray_type insn_addresses_;
|
|
|
/* Max uid for which the above arrays are valid. */
|
/* Max uid for which the above arrays are valid. */
|
static int insn_lengths_max_uid;
|
static int insn_lengths_max_uid;
|
|
|
/* Address of insn being processed. Used by `insn_current_length'. */
|
/* Address of insn being processed. Used by `insn_current_length'. */
|
int insn_current_address;
|
int insn_current_address;
|
|
|
/* Address of insn being processed in previous iteration. */
|
/* Address of insn being processed in previous iteration. */
|
int insn_last_address;
|
int insn_last_address;
|
|
|
/* known invariant alignment of insn being processed. */
|
/* known invariant alignment of insn being processed. */
|
int insn_current_align;
|
int insn_current_align;
|
|
|
/* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
|
/* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
|
gives the next following alignment insn that increases the known
|
gives the next following alignment insn that increases the known
|
alignment, or NULL_RTX if there is no such insn.
|
alignment, or NULL_RTX if there is no such insn.
|
For any alignment obtained this way, we can again index uid_align with
|
For any alignment obtained this way, we can again index uid_align with
|
its uid to obtain the next following align that in turn increases the
|
its uid to obtain the next following align that in turn increases the
|
alignment, till we reach NULL_RTX; the sequence obtained this way
|
alignment, till we reach NULL_RTX; the sequence obtained this way
|
for each insn we'll call the alignment chain of this insn in the following
|
for each insn we'll call the alignment chain of this insn in the following
|
comments. */
|
comments. */
|
|
|
struct label_alignment
|
struct label_alignment
|
{
|
{
|
short alignment;
|
short alignment;
|
short max_skip;
|
short max_skip;
|
};
|
};
|
|
|
static rtx *uid_align;
|
static rtx *uid_align;
|
static int *uid_shuid;
|
static int *uid_shuid;
|
static struct label_alignment *label_align;
|
static struct label_alignment *label_align;
|
|
|
/* Indicate that branch shortening hasn't yet been done. */
|
/* Indicate that branch shortening hasn't yet been done. */
|
|
|
void
|
void
|
init_insn_lengths (void)
|
init_insn_lengths (void)
|
{
|
{
|
if (uid_shuid)
|
if (uid_shuid)
|
{
|
{
|
free (uid_shuid);
|
free (uid_shuid);
|
uid_shuid = 0;
|
uid_shuid = 0;
|
}
|
}
|
if (insn_lengths)
|
if (insn_lengths)
|
{
|
{
|
free (insn_lengths);
|
free (insn_lengths);
|
insn_lengths = 0;
|
insn_lengths = 0;
|
insn_lengths_max_uid = 0;
|
insn_lengths_max_uid = 0;
|
}
|
}
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
INSN_ADDRESSES_FREE ();
|
INSN_ADDRESSES_FREE ();
|
#endif
|
#endif
|
if (uid_align)
|
if (uid_align)
|
{
|
{
|
free (uid_align);
|
free (uid_align);
|
uid_align = 0;
|
uid_align = 0;
|
}
|
}
|
}
|
}
|
|
|
/* Obtain the current length of an insn. If branch shortening has been done,
|
/* Obtain the current length of an insn. If branch shortening has been done,
|
get its actual length. Otherwise, use FALLBACK_FN to calculate the
|
get its actual length. Otherwise, use FALLBACK_FN to calculate the
|
length. */
|
length. */
|
static inline int
|
static inline int
|
get_attr_length_1 (rtx insn ATTRIBUTE_UNUSED,
|
get_attr_length_1 (rtx insn ATTRIBUTE_UNUSED,
|
int (*fallback_fn) (rtx) ATTRIBUTE_UNUSED)
|
int (*fallback_fn) (rtx) ATTRIBUTE_UNUSED)
|
{
|
{
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
rtx body;
|
rtx body;
|
int i;
|
int i;
|
int length = 0;
|
int length = 0;
|
|
|
if (insn_lengths_max_uid > INSN_UID (insn))
|
if (insn_lengths_max_uid > INSN_UID (insn))
|
return insn_lengths[INSN_UID (insn)];
|
return insn_lengths[INSN_UID (insn)];
|
else
|
else
|
switch (GET_CODE (insn))
|
switch (GET_CODE (insn))
|
{
|
{
|
case NOTE:
|
case NOTE:
|
case BARRIER:
|
case BARRIER:
|
case CODE_LABEL:
|
case CODE_LABEL:
|
return 0;
|
return 0;
|
|
|
case CALL_INSN:
|
case CALL_INSN:
|
length = fallback_fn (insn);
|
length = fallback_fn (insn);
|
break;
|
break;
|
|
|
case JUMP_INSN:
|
case JUMP_INSN:
|
body = PATTERN (insn);
|
body = PATTERN (insn);
|
if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
|
if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
|
{
|
{
|
/* Alignment is machine-dependent and should be handled by
|
/* Alignment is machine-dependent and should be handled by
|
ADDR_VEC_ALIGN. */
|
ADDR_VEC_ALIGN. */
|
}
|
}
|
else
|
else
|
length = fallback_fn (insn);
|
length = fallback_fn (insn);
|
break;
|
break;
|
|
|
case INSN:
|
case INSN:
|
body = PATTERN (insn);
|
body = PATTERN (insn);
|
if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
|
if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
|
return 0;
|
return 0;
|
|
|
else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
|
else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
|
length = asm_insn_count (body) * fallback_fn (insn);
|
length = asm_insn_count (body) * fallback_fn (insn);
|
else if (GET_CODE (body) == SEQUENCE)
|
else if (GET_CODE (body) == SEQUENCE)
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
length += get_attr_length (XVECEXP (body, 0, i));
|
length += get_attr_length (XVECEXP (body, 0, i));
|
else
|
else
|
length = fallback_fn (insn);
|
length = fallback_fn (insn);
|
break;
|
break;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
#ifdef ADJUST_INSN_LENGTH
|
#ifdef ADJUST_INSN_LENGTH
|
ADJUST_INSN_LENGTH (insn, length);
|
ADJUST_INSN_LENGTH (insn, length);
|
#endif
|
#endif
|
return length;
|
return length;
|
#else /* not HAVE_ATTR_length */
|
#else /* not HAVE_ATTR_length */
|
return 0;
|
return 0;
|
#define insn_default_length 0
|
#define insn_default_length 0
|
#define insn_min_length 0
|
#define insn_min_length 0
|
#endif /* not HAVE_ATTR_length */
|
#endif /* not HAVE_ATTR_length */
|
}
|
}
|
|
|
/* Obtain the current length of an insn. If branch shortening has been done,
|
/* Obtain the current length of an insn. If branch shortening has been done,
|
get its actual length. Otherwise, get its maximum length. */
|
get its actual length. Otherwise, get its maximum length. */
|
int
|
int
|
get_attr_length (rtx insn)
|
get_attr_length (rtx insn)
|
{
|
{
|
return get_attr_length_1 (insn, insn_default_length);
|
return get_attr_length_1 (insn, insn_default_length);
|
}
|
}
|
|
|
/* Obtain the current length of an insn. If branch shortening has been done,
|
/* Obtain the current length of an insn. If branch shortening has been done,
|
get its actual length. Otherwise, get its minimum length. */
|
get its actual length. Otherwise, get its minimum length. */
|
int
|
int
|
get_attr_min_length (rtx insn)
|
get_attr_min_length (rtx insn)
|
{
|
{
|
return get_attr_length_1 (insn, insn_min_length);
|
return get_attr_length_1 (insn, insn_min_length);
|
}
|
}
|
|
|
/* Code to handle alignment inside shorten_branches. */
|
/* Code to handle alignment inside shorten_branches. */
|
|
|
/* Here is an explanation how the algorithm in align_fuzz can give
|
/* Here is an explanation how the algorithm in align_fuzz can give
|
proper results:
|
proper results:
|
|
|
Call a sequence of instructions beginning with alignment point X
|
Call a sequence of instructions beginning with alignment point X
|
and continuing until the next alignment point `block X'. When `X'
|
and continuing until the next alignment point `block X'. When `X'
|
is used in an expression, it means the alignment value of the
|
is used in an expression, it means the alignment value of the
|
alignment point.
|
alignment point.
|
|
|
Call the distance between the start of the first insn of block X, and
|
Call the distance between the start of the first insn of block X, and
|
the end of the last insn of block X `IX', for the `inner size of X'.
|
the end of the last insn of block X `IX', for the `inner size of X'.
|
This is clearly the sum of the instruction lengths.
|
This is clearly the sum of the instruction lengths.
|
|
|
Likewise with the next alignment-delimited block following X, which we
|
Likewise with the next alignment-delimited block following X, which we
|
shall call block Y.
|
shall call block Y.
|
|
|
Call the distance between the start of the first insn of block X, and
|
Call the distance between the start of the first insn of block X, and
|
the start of the first insn of block Y `OX', for the `outer size of X'.
|
the start of the first insn of block Y `OX', for the `outer size of X'.
|
|
|
The estimated padding is then OX - IX.
|
The estimated padding is then OX - IX.
|
|
|
OX can be safely estimated as
|
OX can be safely estimated as
|
|
|
if (X >= Y)
|
if (X >= Y)
|
OX = round_up(IX, Y)
|
OX = round_up(IX, Y)
|
else
|
else
|
OX = round_up(IX, X) + Y - X
|
OX = round_up(IX, X) + Y - X
|
|
|
Clearly est(IX) >= real(IX), because that only depends on the
|
Clearly est(IX) >= real(IX), because that only depends on the
|
instruction lengths, and those being overestimated is a given.
|
instruction lengths, and those being overestimated is a given.
|
|
|
Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
|
Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
|
we needn't worry about that when thinking about OX.
|
we needn't worry about that when thinking about OX.
|
|
|
When X >= Y, the alignment provided by Y adds no uncertainty factor
|
When X >= Y, the alignment provided by Y adds no uncertainty factor
|
for branch ranges starting before X, so we can just round what we have.
|
for branch ranges starting before X, so we can just round what we have.
|
But when X < Y, we don't know anything about the, so to speak,
|
But when X < Y, we don't know anything about the, so to speak,
|
`middle bits', so we have to assume the worst when aligning up from an
|
`middle bits', so we have to assume the worst when aligning up from an
|
address mod X to one mod Y, which is Y - X. */
|
address mod X to one mod Y, which is Y - X. */
|
|
|
#ifndef LABEL_ALIGN
|
#ifndef LABEL_ALIGN
|
#define LABEL_ALIGN(LABEL) align_labels_log
|
#define LABEL_ALIGN(LABEL) align_labels_log
|
#endif
|
#endif
|
|
|
#ifndef LABEL_ALIGN_MAX_SKIP
|
#ifndef LABEL_ALIGN_MAX_SKIP
|
#define LABEL_ALIGN_MAX_SKIP align_labels_max_skip
|
#define LABEL_ALIGN_MAX_SKIP align_labels_max_skip
|
#endif
|
#endif
|
|
|
#ifndef LOOP_ALIGN
|
#ifndef LOOP_ALIGN
|
#define LOOP_ALIGN(LABEL) align_loops_log
|
#define LOOP_ALIGN(LABEL) align_loops_log
|
#endif
|
#endif
|
|
|
#ifndef LOOP_ALIGN_MAX_SKIP
|
#ifndef LOOP_ALIGN_MAX_SKIP
|
#define LOOP_ALIGN_MAX_SKIP align_loops_max_skip
|
#define LOOP_ALIGN_MAX_SKIP align_loops_max_skip
|
#endif
|
#endif
|
|
|
#ifndef LABEL_ALIGN_AFTER_BARRIER
|
#ifndef LABEL_ALIGN_AFTER_BARRIER
|
#define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
|
#define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
|
#endif
|
#endif
|
|
|
#ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
|
#ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
|
#define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
|
#define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
|
#endif
|
#endif
|
|
|
#ifndef JUMP_ALIGN
|
#ifndef JUMP_ALIGN
|
#define JUMP_ALIGN(LABEL) align_jumps_log
|
#define JUMP_ALIGN(LABEL) align_jumps_log
|
#endif
|
#endif
|
|
|
#ifndef JUMP_ALIGN_MAX_SKIP
|
#ifndef JUMP_ALIGN_MAX_SKIP
|
#define JUMP_ALIGN_MAX_SKIP align_jumps_max_skip
|
#define JUMP_ALIGN_MAX_SKIP align_jumps_max_skip
|
#endif
|
#endif
|
|
|
#ifndef ADDR_VEC_ALIGN
|
#ifndef ADDR_VEC_ALIGN
|
static int
|
static int
|
final_addr_vec_align (rtx addr_vec)
|
final_addr_vec_align (rtx addr_vec)
|
{
|
{
|
int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
|
int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
|
|
|
if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
|
if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
|
align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
|
align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
|
return exact_log2 (align);
|
return exact_log2 (align);
|
|
|
}
|
}
|
|
|
#define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
|
#define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
|
#endif
|
#endif
|
|
|
#ifndef INSN_LENGTH_ALIGNMENT
|
#ifndef INSN_LENGTH_ALIGNMENT
|
#define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
|
#define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
|
#endif
|
#endif
|
|
|
#define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
|
#define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
|
|
|
static int min_labelno, max_labelno;
|
static int min_labelno, max_labelno;
|
|
|
#define LABEL_TO_ALIGNMENT(LABEL) \
|
#define LABEL_TO_ALIGNMENT(LABEL) \
|
(label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
|
(label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
|
|
|
#define LABEL_TO_MAX_SKIP(LABEL) \
|
#define LABEL_TO_MAX_SKIP(LABEL) \
|
(label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
|
(label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
|
|
|
/* For the benefit of port specific code do this also as a function. */
|
/* For the benefit of port specific code do this also as a function. */
|
|
|
int
|
int
|
label_to_alignment (rtx label)
|
label_to_alignment (rtx label)
|
{
|
{
|
return LABEL_TO_ALIGNMENT (label);
|
return LABEL_TO_ALIGNMENT (label);
|
}
|
}
|
|
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
/* The differences in addresses
|
/* The differences in addresses
|
between a branch and its target might grow or shrink depending on
|
between a branch and its target might grow or shrink depending on
|
the alignment the start insn of the range (the branch for a forward
|
the alignment the start insn of the range (the branch for a forward
|
branch or the label for a backward branch) starts out on; if these
|
branch or the label for a backward branch) starts out on; if these
|
differences are used naively, they can even oscillate infinitely.
|
differences are used naively, they can even oscillate infinitely.
|
We therefore want to compute a 'worst case' address difference that
|
We therefore want to compute a 'worst case' address difference that
|
is independent of the alignment the start insn of the range end
|
is independent of the alignment the start insn of the range end
|
up on, and that is at least as large as the actual difference.
|
up on, and that is at least as large as the actual difference.
|
The function align_fuzz calculates the amount we have to add to the
|
The function align_fuzz calculates the amount we have to add to the
|
naively computed difference, by traversing the part of the alignment
|
naively computed difference, by traversing the part of the alignment
|
chain of the start insn of the range that is in front of the end insn
|
chain of the start insn of the range that is in front of the end insn
|
of the range, and considering for each alignment the maximum amount
|
of the range, and considering for each alignment the maximum amount
|
that it might contribute to a size increase.
|
that it might contribute to a size increase.
|
|
|
For casesi tables, we also want to know worst case minimum amounts of
|
For casesi tables, we also want to know worst case minimum amounts of
|
address difference, in case a machine description wants to introduce
|
address difference, in case a machine description wants to introduce
|
some common offset that is added to all offsets in a table.
|
some common offset that is added to all offsets in a table.
|
For this purpose, align_fuzz with a growth argument of 0 computes the
|
For this purpose, align_fuzz with a growth argument of 0 computes the
|
appropriate adjustment. */
|
appropriate adjustment. */
|
|
|
/* Compute the maximum delta by which the difference of the addresses of
|
/* Compute the maximum delta by which the difference of the addresses of
|
START and END might grow / shrink due to a different address for start
|
START and END might grow / shrink due to a different address for start
|
which changes the size of alignment insns between START and END.
|
which changes the size of alignment insns between START and END.
|
KNOWN_ALIGN_LOG is the alignment known for START.
|
KNOWN_ALIGN_LOG is the alignment known for START.
|
GROWTH should be ~0 if the objective is to compute potential code size
|
GROWTH should be ~0 if the objective is to compute potential code size
|
increase, and 0 if the objective is to compute potential shrink.
|
increase, and 0 if the objective is to compute potential shrink.
|
The return value is undefined for any other value of GROWTH. */
|
The return value is undefined for any other value of GROWTH. */
|
|
|
static int
|
static int
|
align_fuzz (rtx start, rtx end, int known_align_log, unsigned int growth)
|
align_fuzz (rtx start, rtx end, int known_align_log, unsigned int growth)
|
{
|
{
|
int uid = INSN_UID (start);
|
int uid = INSN_UID (start);
|
rtx align_label;
|
rtx align_label;
|
int known_align = 1 << known_align_log;
|
int known_align = 1 << known_align_log;
|
int end_shuid = INSN_SHUID (end);
|
int end_shuid = INSN_SHUID (end);
|
int fuzz = 0;
|
int fuzz = 0;
|
|
|
for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
|
for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
|
{
|
{
|
int align_addr, new_align;
|
int align_addr, new_align;
|
|
|
uid = INSN_UID (align_label);
|
uid = INSN_UID (align_label);
|
align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
|
align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
|
if (uid_shuid[uid] > end_shuid)
|
if (uid_shuid[uid] > end_shuid)
|
break;
|
break;
|
known_align_log = LABEL_TO_ALIGNMENT (align_label);
|
known_align_log = LABEL_TO_ALIGNMENT (align_label);
|
new_align = 1 << known_align_log;
|
new_align = 1 << known_align_log;
|
if (new_align < known_align)
|
if (new_align < known_align)
|
continue;
|
continue;
|
fuzz += (-align_addr ^ growth) & (new_align - known_align);
|
fuzz += (-align_addr ^ growth) & (new_align - known_align);
|
known_align = new_align;
|
known_align = new_align;
|
}
|
}
|
return fuzz;
|
return fuzz;
|
}
|
}
|
|
|
/* Compute a worst-case reference address of a branch so that it
|
/* Compute a worst-case reference address of a branch so that it
|
can be safely used in the presence of aligned labels. Since the
|
can be safely used in the presence of aligned labels. Since the
|
size of the branch itself is unknown, the size of the branch is
|
size of the branch itself is unknown, the size of the branch is
|
not included in the range. I.e. for a forward branch, the reference
|
not included in the range. I.e. for a forward branch, the reference
|
address is the end address of the branch as known from the previous
|
address is the end address of the branch as known from the previous
|
branch shortening pass, minus a value to account for possible size
|
branch shortening pass, minus a value to account for possible size
|
increase due to alignment. For a backward branch, it is the start
|
increase due to alignment. For a backward branch, it is the start
|
address of the branch as known from the current pass, plus a value
|
address of the branch as known from the current pass, plus a value
|
to account for possible size increase due to alignment.
|
to account for possible size increase due to alignment.
|
NB.: Therefore, the maximum offset allowed for backward branches needs
|
NB.: Therefore, the maximum offset allowed for backward branches needs
|
to exclude the branch size. */
|
to exclude the branch size. */
|
|
|
int
|
int
|
insn_current_reference_address (rtx branch)
|
insn_current_reference_address (rtx branch)
|
{
|
{
|
rtx dest, seq;
|
rtx dest, seq;
|
int seq_uid;
|
int seq_uid;
|
|
|
if (! INSN_ADDRESSES_SET_P ())
|
if (! INSN_ADDRESSES_SET_P ())
|
return 0;
|
return 0;
|
|
|
seq = NEXT_INSN (PREV_INSN (branch));
|
seq = NEXT_INSN (PREV_INSN (branch));
|
seq_uid = INSN_UID (seq);
|
seq_uid = INSN_UID (seq);
|
if (!JUMP_P (branch))
|
if (!JUMP_P (branch))
|
/* This can happen for example on the PA; the objective is to know the
|
/* This can happen for example on the PA; the objective is to know the
|
offset to address something in front of the start of the function.
|
offset to address something in front of the start of the function.
|
Thus, we can treat it like a backward branch.
|
Thus, we can treat it like a backward branch.
|
We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
|
We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
|
any alignment we'd encounter, so we skip the call to align_fuzz. */
|
any alignment we'd encounter, so we skip the call to align_fuzz. */
|
return insn_current_address;
|
return insn_current_address;
|
dest = JUMP_LABEL (branch);
|
dest = JUMP_LABEL (branch);
|
|
|
/* BRANCH has no proper alignment chain set, so use SEQ.
|
/* BRANCH has no proper alignment chain set, so use SEQ.
|
BRANCH also has no INSN_SHUID. */
|
BRANCH also has no INSN_SHUID. */
|
if (INSN_SHUID (seq) < INSN_SHUID (dest))
|
if (INSN_SHUID (seq) < INSN_SHUID (dest))
|
{
|
{
|
/* Forward branch. */
|
/* Forward branch. */
|
return (insn_last_address + insn_lengths[seq_uid]
|
return (insn_last_address + insn_lengths[seq_uid]
|
- align_fuzz (seq, dest, length_unit_log, ~0));
|
- align_fuzz (seq, dest, length_unit_log, ~0));
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Backward branch. */
|
/* Backward branch. */
|
return (insn_current_address
|
return (insn_current_address
|
+ align_fuzz (dest, seq, length_unit_log, ~0));
|
+ align_fuzz (dest, seq, length_unit_log, ~0));
|
}
|
}
|
}
|
}
|
#endif /* HAVE_ATTR_length */
|
#endif /* HAVE_ATTR_length */
|
|
|
/* Compute branch alignments based on frequency information in the
|
/* Compute branch alignments based on frequency information in the
|
CFG. */
|
CFG. */
|
|
|
static unsigned int
|
static unsigned int
|
compute_alignments (void)
|
compute_alignments (void)
|
{
|
{
|
int log, max_skip, max_log;
|
int log, max_skip, max_log;
|
basic_block bb;
|
basic_block bb;
|
|
|
if (label_align)
|
if (label_align)
|
{
|
{
|
free (label_align);
|
free (label_align);
|
label_align = 0;
|
label_align = 0;
|
}
|
}
|
|
|
max_labelno = max_label_num ();
|
max_labelno = max_label_num ();
|
min_labelno = get_first_label_num ();
|
min_labelno = get_first_label_num ();
|
label_align = XCNEWVEC (struct label_alignment, max_labelno - min_labelno + 1);
|
label_align = XCNEWVEC (struct label_alignment, max_labelno - min_labelno + 1);
|
|
|
/* If not optimizing or optimizing for size, don't assign any alignments. */
|
/* If not optimizing or optimizing for size, don't assign any alignments. */
|
if (! optimize || optimize_size)
|
if (! optimize || optimize_size)
|
return 0;
|
return 0;
|
|
|
FOR_EACH_BB (bb)
|
FOR_EACH_BB (bb)
|
{
|
{
|
rtx label = BB_HEAD (bb);
|
rtx label = BB_HEAD (bb);
|
int fallthru_frequency = 0, branch_frequency = 0, has_fallthru = 0;
|
int fallthru_frequency = 0, branch_frequency = 0, has_fallthru = 0;
|
edge e;
|
edge e;
|
edge_iterator ei;
|
edge_iterator ei;
|
|
|
if (!LABEL_P (label)
|
if (!LABEL_P (label)
|
|| probably_never_executed_bb_p (bb))
|
|| probably_never_executed_bb_p (bb))
|
continue;
|
continue;
|
max_log = LABEL_ALIGN (label);
|
max_log = LABEL_ALIGN (label);
|
max_skip = LABEL_ALIGN_MAX_SKIP;
|
max_skip = LABEL_ALIGN_MAX_SKIP;
|
|
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
{
|
{
|
if (e->flags & EDGE_FALLTHRU)
|
if (e->flags & EDGE_FALLTHRU)
|
has_fallthru = 1, fallthru_frequency += EDGE_FREQUENCY (e);
|
has_fallthru = 1, fallthru_frequency += EDGE_FREQUENCY (e);
|
else
|
else
|
branch_frequency += EDGE_FREQUENCY (e);
|
branch_frequency += EDGE_FREQUENCY (e);
|
}
|
}
|
|
|
/* There are two purposes to align block with no fallthru incoming edge:
|
/* There are two purposes to align block with no fallthru incoming edge:
|
1) to avoid fetch stalls when branch destination is near cache boundary
|
1) to avoid fetch stalls when branch destination is near cache boundary
|
2) to improve cache efficiency in case the previous block is not executed
|
2) to improve cache efficiency in case the previous block is not executed
|
(so it does not need to be in the cache).
|
(so it does not need to be in the cache).
|
|
|
We to catch first case, we align frequently executed blocks.
|
We to catch first case, we align frequently executed blocks.
|
To catch the second, we align blocks that are executed more frequently
|
To catch the second, we align blocks that are executed more frequently
|
than the predecessor and the predecessor is likely to not be executed
|
than the predecessor and the predecessor is likely to not be executed
|
when function is called. */
|
when function is called. */
|
|
|
if (!has_fallthru
|
if (!has_fallthru
|
&& (branch_frequency > BB_FREQ_MAX / 10
|
&& (branch_frequency > BB_FREQ_MAX / 10
|
|| (bb->frequency > bb->prev_bb->frequency * 10
|
|| (bb->frequency > bb->prev_bb->frequency * 10
|
&& (bb->prev_bb->frequency
|
&& (bb->prev_bb->frequency
|
<= ENTRY_BLOCK_PTR->frequency / 2))))
|
<= ENTRY_BLOCK_PTR->frequency / 2))))
|
{
|
{
|
log = JUMP_ALIGN (label);
|
log = JUMP_ALIGN (label);
|
if (max_log < log)
|
if (max_log < log)
|
{
|
{
|
max_log = log;
|
max_log = log;
|
max_skip = JUMP_ALIGN_MAX_SKIP;
|
max_skip = JUMP_ALIGN_MAX_SKIP;
|
}
|
}
|
}
|
}
|
/* In case block is frequent and reached mostly by non-fallthru edge,
|
/* In case block is frequent and reached mostly by non-fallthru edge,
|
align it. It is most likely a first block of loop. */
|
align it. It is most likely a first block of loop. */
|
if (has_fallthru
|
if (has_fallthru
|
&& maybe_hot_bb_p (bb)
|
&& maybe_hot_bb_p (bb)
|
&& branch_frequency + fallthru_frequency > BB_FREQ_MAX / 10
|
&& branch_frequency + fallthru_frequency > BB_FREQ_MAX / 10
|
&& branch_frequency > fallthru_frequency * 2)
|
&& branch_frequency > fallthru_frequency * 2)
|
{
|
{
|
log = LOOP_ALIGN (label);
|
log = LOOP_ALIGN (label);
|
if (max_log < log)
|
if (max_log < log)
|
{
|
{
|
max_log = log;
|
max_log = log;
|
max_skip = LOOP_ALIGN_MAX_SKIP;
|
max_skip = LOOP_ALIGN_MAX_SKIP;
|
}
|
}
|
}
|
}
|
LABEL_TO_ALIGNMENT (label) = max_log;
|
LABEL_TO_ALIGNMENT (label) = max_log;
|
LABEL_TO_MAX_SKIP (label) = max_skip;
|
LABEL_TO_MAX_SKIP (label) = max_skip;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct tree_opt_pass pass_compute_alignments =
|
struct tree_opt_pass pass_compute_alignments =
|
{
|
{
|
NULL, /* name */
|
NULL, /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
compute_alignments, /* execute */
|
compute_alignments, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
0, /* tv_id */
|
0, /* tv_id */
|
0, /* properties_required */
|
0, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
0, /* todo_flags_finish */
|
0, /* todo_flags_finish */
|
0 /* letter */
|
0 /* letter */
|
};
|
};
|
|
|
|
|
/* Make a pass over all insns and compute their actual lengths by shortening
|
/* Make a pass over all insns and compute their actual lengths by shortening
|
any branches of variable length if possible. */
|
any branches of variable length if possible. */
|
|
|
/* shorten_branches might be called multiple times: for example, the SH
|
/* shorten_branches might be called multiple times: for example, the SH
|
port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
|
port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
|
In order to do this, it needs proper length information, which it obtains
|
In order to do this, it needs proper length information, which it obtains
|
by calling shorten_branches. This cannot be collapsed with
|
by calling shorten_branches. This cannot be collapsed with
|
shorten_branches itself into a single pass unless we also want to integrate
|
shorten_branches itself into a single pass unless we also want to integrate
|
reorg.c, since the branch splitting exposes new instructions with delay
|
reorg.c, since the branch splitting exposes new instructions with delay
|
slots. */
|
slots. */
|
|
|
void
|
void
|
shorten_branches (rtx first ATTRIBUTE_UNUSED)
|
shorten_branches (rtx first ATTRIBUTE_UNUSED)
|
{
|
{
|
rtx insn;
|
rtx insn;
|
int max_uid;
|
int max_uid;
|
int i;
|
int i;
|
int max_log;
|
int max_log;
|
int max_skip;
|
int max_skip;
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
#define MAX_CODE_ALIGN 16
|
#define MAX_CODE_ALIGN 16
|
rtx seq;
|
rtx seq;
|
int something_changed = 1;
|
int something_changed = 1;
|
char *varying_length;
|
char *varying_length;
|
rtx body;
|
rtx body;
|
int uid;
|
int uid;
|
rtx align_tab[MAX_CODE_ALIGN];
|
rtx align_tab[MAX_CODE_ALIGN];
|
|
|
#endif
|
#endif
|
|
|
/* Compute maximum UID and allocate label_align / uid_shuid. */
|
/* Compute maximum UID and allocate label_align / uid_shuid. */
|
max_uid = get_max_uid ();
|
max_uid = get_max_uid ();
|
|
|
/* Free uid_shuid before reallocating it. */
|
/* Free uid_shuid before reallocating it. */
|
free (uid_shuid);
|
free (uid_shuid);
|
|
|
uid_shuid = XNEWVEC (int, max_uid);
|
uid_shuid = XNEWVEC (int, max_uid);
|
|
|
if (max_labelno != max_label_num ())
|
if (max_labelno != max_label_num ())
|
{
|
{
|
int old = max_labelno;
|
int old = max_labelno;
|
int n_labels;
|
int n_labels;
|
int n_old_labels;
|
int n_old_labels;
|
|
|
max_labelno = max_label_num ();
|
max_labelno = max_label_num ();
|
|
|
n_labels = max_labelno - min_labelno + 1;
|
n_labels = max_labelno - min_labelno + 1;
|
n_old_labels = old - min_labelno + 1;
|
n_old_labels = old - min_labelno + 1;
|
|
|
label_align = xrealloc (label_align,
|
label_align = xrealloc (label_align,
|
n_labels * sizeof (struct label_alignment));
|
n_labels * sizeof (struct label_alignment));
|
|
|
/* Range of labels grows monotonically in the function. Failing here
|
/* Range of labels grows monotonically in the function. Failing here
|
means that the initialization of array got lost. */
|
means that the initialization of array got lost. */
|
gcc_assert (n_old_labels <= n_labels);
|
gcc_assert (n_old_labels <= n_labels);
|
|
|
memset (label_align + n_old_labels, 0,
|
memset (label_align + n_old_labels, 0,
|
(n_labels - n_old_labels) * sizeof (struct label_alignment));
|
(n_labels - n_old_labels) * sizeof (struct label_alignment));
|
}
|
}
|
|
|
/* Initialize label_align and set up uid_shuid to be strictly
|
/* Initialize label_align and set up uid_shuid to be strictly
|
monotonically rising with insn order. */
|
monotonically rising with insn order. */
|
/* We use max_log here to keep track of the maximum alignment we want to
|
/* We use max_log here to keep track of the maximum alignment we want to
|
impose on the next CODE_LABEL (or the current one if we are processing
|
impose on the next CODE_LABEL (or the current one if we are processing
|
the CODE_LABEL itself). */
|
the CODE_LABEL itself). */
|
|
|
max_log = 0;
|
max_log = 0;
|
max_skip = 0;
|
max_skip = 0;
|
|
|
for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
|
for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
|
{
|
{
|
int log;
|
int log;
|
|
|
INSN_SHUID (insn) = i++;
|
INSN_SHUID (insn) = i++;
|
if (INSN_P (insn))
|
if (INSN_P (insn))
|
continue;
|
continue;
|
|
|
if (LABEL_P (insn))
|
if (LABEL_P (insn))
|
{
|
{
|
rtx next;
|
rtx next;
|
|
|
/* Merge in alignments computed by compute_alignments. */
|
/* Merge in alignments computed by compute_alignments. */
|
log = LABEL_TO_ALIGNMENT (insn);
|
log = LABEL_TO_ALIGNMENT (insn);
|
if (max_log < log)
|
if (max_log < log)
|
{
|
{
|
max_log = log;
|
max_log = log;
|
max_skip = LABEL_TO_MAX_SKIP (insn);
|
max_skip = LABEL_TO_MAX_SKIP (insn);
|
}
|
}
|
|
|
log = LABEL_ALIGN (insn);
|
log = LABEL_ALIGN (insn);
|
if (max_log < log)
|
if (max_log < log)
|
{
|
{
|
max_log = log;
|
max_log = log;
|
max_skip = LABEL_ALIGN_MAX_SKIP;
|
max_skip = LABEL_ALIGN_MAX_SKIP;
|
}
|
}
|
next = next_nonnote_insn (insn);
|
next = next_nonnote_insn (insn);
|
/* ADDR_VECs only take room if read-only data goes into the text
|
/* ADDR_VECs only take room if read-only data goes into the text
|
section. */
|
section. */
|
if (JUMP_TABLES_IN_TEXT_SECTION
|
if (JUMP_TABLES_IN_TEXT_SECTION
|
|| readonly_data_section == text_section)
|
|| readonly_data_section == text_section)
|
if (next && JUMP_P (next))
|
if (next && JUMP_P (next))
|
{
|
{
|
rtx nextbody = PATTERN (next);
|
rtx nextbody = PATTERN (next);
|
if (GET_CODE (nextbody) == ADDR_VEC
|
if (GET_CODE (nextbody) == ADDR_VEC
|
|| GET_CODE (nextbody) == ADDR_DIFF_VEC)
|
|| GET_CODE (nextbody) == ADDR_DIFF_VEC)
|
{
|
{
|
log = ADDR_VEC_ALIGN (next);
|
log = ADDR_VEC_ALIGN (next);
|
if (max_log < log)
|
if (max_log < log)
|
{
|
{
|
max_log = log;
|
max_log = log;
|
max_skip = LABEL_ALIGN_MAX_SKIP;
|
max_skip = LABEL_ALIGN_MAX_SKIP;
|
}
|
}
|
}
|
}
|
}
|
}
|
LABEL_TO_ALIGNMENT (insn) = max_log;
|
LABEL_TO_ALIGNMENT (insn) = max_log;
|
LABEL_TO_MAX_SKIP (insn) = max_skip;
|
LABEL_TO_MAX_SKIP (insn) = max_skip;
|
max_log = 0;
|
max_log = 0;
|
max_skip = 0;
|
max_skip = 0;
|
}
|
}
|
else if (BARRIER_P (insn))
|
else if (BARRIER_P (insn))
|
{
|
{
|
rtx label;
|
rtx label;
|
|
|
for (label = insn; label && ! INSN_P (label);
|
for (label = insn; label && ! INSN_P (label);
|
label = NEXT_INSN (label))
|
label = NEXT_INSN (label))
|
if (LABEL_P (label))
|
if (LABEL_P (label))
|
{
|
{
|
log = LABEL_ALIGN_AFTER_BARRIER (insn);
|
log = LABEL_ALIGN_AFTER_BARRIER (insn);
|
if (max_log < log)
|
if (max_log < log)
|
{
|
{
|
max_log = log;
|
max_log = log;
|
max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
|
max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
|
}
|
}
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
|
|
/* Allocate the rest of the arrays. */
|
/* Allocate the rest of the arrays. */
|
insn_lengths = XNEWVEC (int, max_uid);
|
insn_lengths = XNEWVEC (int, max_uid);
|
insn_lengths_max_uid = max_uid;
|
insn_lengths_max_uid = max_uid;
|
/* Syntax errors can lead to labels being outside of the main insn stream.
|
/* Syntax errors can lead to labels being outside of the main insn stream.
|
Initialize insn_addresses, so that we get reproducible results. */
|
Initialize insn_addresses, so that we get reproducible results. */
|
INSN_ADDRESSES_ALLOC (max_uid);
|
INSN_ADDRESSES_ALLOC (max_uid);
|
|
|
varying_length = XCNEWVEC (char, max_uid);
|
varying_length = XCNEWVEC (char, max_uid);
|
|
|
/* Initialize uid_align. We scan instructions
|
/* Initialize uid_align. We scan instructions
|
from end to start, and keep in align_tab[n] the last seen insn
|
from end to start, and keep in align_tab[n] the last seen insn
|
that does an alignment of at least n+1, i.e. the successor
|
that does an alignment of at least n+1, i.e. the successor
|
in the alignment chain for an insn that does / has a known
|
in the alignment chain for an insn that does / has a known
|
alignment of n. */
|
alignment of n. */
|
uid_align = XCNEWVEC (rtx, max_uid);
|
uid_align = XCNEWVEC (rtx, max_uid);
|
|
|
for (i = MAX_CODE_ALIGN; --i >= 0;)
|
for (i = MAX_CODE_ALIGN; --i >= 0;)
|
align_tab[i] = NULL_RTX;
|
align_tab[i] = NULL_RTX;
|
seq = get_last_insn ();
|
seq = get_last_insn ();
|
for (; seq; seq = PREV_INSN (seq))
|
for (; seq; seq = PREV_INSN (seq))
|
{
|
{
|
int uid = INSN_UID (seq);
|
int uid = INSN_UID (seq);
|
int log;
|
int log;
|
log = (LABEL_P (seq) ? LABEL_TO_ALIGNMENT (seq) : 0);
|
log = (LABEL_P (seq) ? LABEL_TO_ALIGNMENT (seq) : 0);
|
uid_align[uid] = align_tab[0];
|
uid_align[uid] = align_tab[0];
|
if (log)
|
if (log)
|
{
|
{
|
/* Found an alignment label. */
|
/* Found an alignment label. */
|
uid_align[uid] = align_tab[log];
|
uid_align[uid] = align_tab[log];
|
for (i = log - 1; i >= 0; i--)
|
for (i = log - 1; i >= 0; i--)
|
align_tab[i] = seq;
|
align_tab[i] = seq;
|
}
|
}
|
}
|
}
|
#ifdef CASE_VECTOR_SHORTEN_MODE
|
#ifdef CASE_VECTOR_SHORTEN_MODE
|
if (optimize)
|
if (optimize)
|
{
|
{
|
/* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
|
/* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
|
label fields. */
|
label fields. */
|
|
|
int min_shuid = INSN_SHUID (get_insns ()) - 1;
|
int min_shuid = INSN_SHUID (get_insns ()) - 1;
|
int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
|
int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
|
int rel;
|
int rel;
|
|
|
for (insn = first; insn != 0; insn = NEXT_INSN (insn))
|
for (insn = first; insn != 0; insn = NEXT_INSN (insn))
|
{
|
{
|
rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
|
rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
|
int len, i, min, max, insn_shuid;
|
int len, i, min, max, insn_shuid;
|
int min_align;
|
int min_align;
|
addr_diff_vec_flags flags;
|
addr_diff_vec_flags flags;
|
|
|
if (!JUMP_P (insn)
|
if (!JUMP_P (insn)
|
|| GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
|
|| GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
|
continue;
|
continue;
|
pat = PATTERN (insn);
|
pat = PATTERN (insn);
|
len = XVECLEN (pat, 1);
|
len = XVECLEN (pat, 1);
|
gcc_assert (len > 0);
|
gcc_assert (len > 0);
|
min_align = MAX_CODE_ALIGN;
|
min_align = MAX_CODE_ALIGN;
|
for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
|
for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
|
{
|
{
|
rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
|
rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
|
int shuid = INSN_SHUID (lab);
|
int shuid = INSN_SHUID (lab);
|
if (shuid < min)
|
if (shuid < min)
|
{
|
{
|
min = shuid;
|
min = shuid;
|
min_lab = lab;
|
min_lab = lab;
|
}
|
}
|
if (shuid > max)
|
if (shuid > max)
|
{
|
{
|
max = shuid;
|
max = shuid;
|
max_lab = lab;
|
max_lab = lab;
|
}
|
}
|
if (min_align > LABEL_TO_ALIGNMENT (lab))
|
if (min_align > LABEL_TO_ALIGNMENT (lab))
|
min_align = LABEL_TO_ALIGNMENT (lab);
|
min_align = LABEL_TO_ALIGNMENT (lab);
|
}
|
}
|
XEXP (pat, 2) = gen_rtx_LABEL_REF (Pmode, min_lab);
|
XEXP (pat, 2) = gen_rtx_LABEL_REF (Pmode, min_lab);
|
XEXP (pat, 3) = gen_rtx_LABEL_REF (Pmode, max_lab);
|
XEXP (pat, 3) = gen_rtx_LABEL_REF (Pmode, max_lab);
|
insn_shuid = INSN_SHUID (insn);
|
insn_shuid = INSN_SHUID (insn);
|
rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
|
rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
|
memset (&flags, 0, sizeof (flags));
|
memset (&flags, 0, sizeof (flags));
|
flags.min_align = min_align;
|
flags.min_align = min_align;
|
flags.base_after_vec = rel > insn_shuid;
|
flags.base_after_vec = rel > insn_shuid;
|
flags.min_after_vec = min > insn_shuid;
|
flags.min_after_vec = min > insn_shuid;
|
flags.max_after_vec = max > insn_shuid;
|
flags.max_after_vec = max > insn_shuid;
|
flags.min_after_base = min > rel;
|
flags.min_after_base = min > rel;
|
flags.max_after_base = max > rel;
|
flags.max_after_base = max > rel;
|
ADDR_DIFF_VEC_FLAGS (pat) = flags;
|
ADDR_DIFF_VEC_FLAGS (pat) = flags;
|
}
|
}
|
}
|
}
|
#endif /* CASE_VECTOR_SHORTEN_MODE */
|
#endif /* CASE_VECTOR_SHORTEN_MODE */
|
|
|
/* Compute initial lengths, addresses, and varying flags for each insn. */
|
/* Compute initial lengths, addresses, and varying flags for each insn. */
|
for (insn_current_address = 0, insn = first;
|
for (insn_current_address = 0, insn = first;
|
insn != 0;
|
insn != 0;
|
insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
|
insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
|
{
|
{
|
uid = INSN_UID (insn);
|
uid = INSN_UID (insn);
|
|
|
insn_lengths[uid] = 0;
|
insn_lengths[uid] = 0;
|
|
|
if (LABEL_P (insn))
|
if (LABEL_P (insn))
|
{
|
{
|
int log = LABEL_TO_ALIGNMENT (insn);
|
int log = LABEL_TO_ALIGNMENT (insn);
|
if (log)
|
if (log)
|
{
|
{
|
int align = 1 << log;
|
int align = 1 << log;
|
int new_address = (insn_current_address + align - 1) & -align;
|
int new_address = (insn_current_address + align - 1) & -align;
|
insn_lengths[uid] = new_address - insn_current_address;
|
insn_lengths[uid] = new_address - insn_current_address;
|
}
|
}
|
}
|
}
|
|
|
INSN_ADDRESSES (uid) = insn_current_address + insn_lengths[uid];
|
INSN_ADDRESSES (uid) = insn_current_address + insn_lengths[uid];
|
|
|
if (NOTE_P (insn) || BARRIER_P (insn)
|
if (NOTE_P (insn) || BARRIER_P (insn)
|
|| LABEL_P (insn))
|
|| LABEL_P (insn))
|
continue;
|
continue;
|
if (INSN_DELETED_P (insn))
|
if (INSN_DELETED_P (insn))
|
continue;
|
continue;
|
|
|
body = PATTERN (insn);
|
body = PATTERN (insn);
|
if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
|
if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
|
{
|
{
|
/* This only takes room if read-only data goes into the text
|
/* This only takes room if read-only data goes into the text
|
section. */
|
section. */
|
if (JUMP_TABLES_IN_TEXT_SECTION
|
if (JUMP_TABLES_IN_TEXT_SECTION
|
|| readonly_data_section == text_section)
|
|| readonly_data_section == text_section)
|
insn_lengths[uid] = (XVECLEN (body,
|
insn_lengths[uid] = (XVECLEN (body,
|
GET_CODE (body) == ADDR_DIFF_VEC)
|
GET_CODE (body) == ADDR_DIFF_VEC)
|
* GET_MODE_SIZE (GET_MODE (body)));
|
* GET_MODE_SIZE (GET_MODE (body)));
|
/* Alignment is handled by ADDR_VEC_ALIGN. */
|
/* Alignment is handled by ADDR_VEC_ALIGN. */
|
}
|
}
|
else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
|
else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
|
insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
|
insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
|
else if (GET_CODE (body) == SEQUENCE)
|
else if (GET_CODE (body) == SEQUENCE)
|
{
|
{
|
int i;
|
int i;
|
int const_delay_slots;
|
int const_delay_slots;
|
#ifdef DELAY_SLOTS
|
#ifdef DELAY_SLOTS
|
const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
|
const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
|
#else
|
#else
|
const_delay_slots = 0;
|
const_delay_slots = 0;
|
#endif
|
#endif
|
/* Inside a delay slot sequence, we do not do any branch shortening
|
/* Inside a delay slot sequence, we do not do any branch shortening
|
if the shortening could change the number of delay slots
|
if the shortening could change the number of delay slots
|
of the branch. */
|
of the branch. */
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
{
|
{
|
rtx inner_insn = XVECEXP (body, 0, i);
|
rtx inner_insn = XVECEXP (body, 0, i);
|
int inner_uid = INSN_UID (inner_insn);
|
int inner_uid = INSN_UID (inner_insn);
|
int inner_length;
|
int inner_length;
|
|
|
if (GET_CODE (body) == ASM_INPUT
|
if (GET_CODE (body) == ASM_INPUT
|
|| asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
|
|| asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
|
inner_length = (asm_insn_count (PATTERN (inner_insn))
|
inner_length = (asm_insn_count (PATTERN (inner_insn))
|
* insn_default_length (inner_insn));
|
* insn_default_length (inner_insn));
|
else
|
else
|
inner_length = insn_default_length (inner_insn);
|
inner_length = insn_default_length (inner_insn);
|
|
|
insn_lengths[inner_uid] = inner_length;
|
insn_lengths[inner_uid] = inner_length;
|
if (const_delay_slots)
|
if (const_delay_slots)
|
{
|
{
|
if ((varying_length[inner_uid]
|
if ((varying_length[inner_uid]
|
= insn_variable_length_p (inner_insn)) != 0)
|
= insn_variable_length_p (inner_insn)) != 0)
|
varying_length[uid] = 1;
|
varying_length[uid] = 1;
|
INSN_ADDRESSES (inner_uid) = (insn_current_address
|
INSN_ADDRESSES (inner_uid) = (insn_current_address
|
+ insn_lengths[uid]);
|
+ insn_lengths[uid]);
|
}
|
}
|
else
|
else
|
varying_length[inner_uid] = 0;
|
varying_length[inner_uid] = 0;
|
insn_lengths[uid] += inner_length;
|
insn_lengths[uid] += inner_length;
|
}
|
}
|
}
|
}
|
else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
|
else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
|
{
|
{
|
insn_lengths[uid] = insn_default_length (insn);
|
insn_lengths[uid] = insn_default_length (insn);
|
varying_length[uid] = insn_variable_length_p (insn);
|
varying_length[uid] = insn_variable_length_p (insn);
|
}
|
}
|
|
|
/* If needed, do any adjustment. */
|
/* If needed, do any adjustment. */
|
#ifdef ADJUST_INSN_LENGTH
|
#ifdef ADJUST_INSN_LENGTH
|
ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
|
ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
|
if (insn_lengths[uid] < 0)
|
if (insn_lengths[uid] < 0)
|
fatal_insn ("negative insn length", insn);
|
fatal_insn ("negative insn length", insn);
|
#endif
|
#endif
|
}
|
}
|
|
|
/* Now loop over all the insns finding varying length insns. For each,
|
/* Now loop over all the insns finding varying length insns. For each,
|
get the current insn length. If it has changed, reflect the change.
|
get the current insn length. If it has changed, reflect the change.
|
When nothing changes for a full pass, we are done. */
|
When nothing changes for a full pass, we are done. */
|
|
|
while (something_changed)
|
while (something_changed)
|
{
|
{
|
something_changed = 0;
|
something_changed = 0;
|
insn_current_align = MAX_CODE_ALIGN - 1;
|
insn_current_align = MAX_CODE_ALIGN - 1;
|
for (insn_current_address = 0, insn = first;
|
for (insn_current_address = 0, insn = first;
|
insn != 0;
|
insn != 0;
|
insn = NEXT_INSN (insn))
|
insn = NEXT_INSN (insn))
|
{
|
{
|
int new_length;
|
int new_length;
|
#ifdef ADJUST_INSN_LENGTH
|
#ifdef ADJUST_INSN_LENGTH
|
int tmp_length;
|
int tmp_length;
|
#endif
|
#endif
|
int length_align;
|
int length_align;
|
|
|
uid = INSN_UID (insn);
|
uid = INSN_UID (insn);
|
|
|
if (LABEL_P (insn))
|
if (LABEL_P (insn))
|
{
|
{
|
int log = LABEL_TO_ALIGNMENT (insn);
|
int log = LABEL_TO_ALIGNMENT (insn);
|
if (log > insn_current_align)
|
if (log > insn_current_align)
|
{
|
{
|
int align = 1 << log;
|
int align = 1 << log;
|
int new_address= (insn_current_address + align - 1) & -align;
|
int new_address= (insn_current_address + align - 1) & -align;
|
insn_lengths[uid] = new_address - insn_current_address;
|
insn_lengths[uid] = new_address - insn_current_address;
|
insn_current_align = log;
|
insn_current_align = log;
|
insn_current_address = new_address;
|
insn_current_address = new_address;
|
}
|
}
|
else
|
else
|
insn_lengths[uid] = 0;
|
insn_lengths[uid] = 0;
|
INSN_ADDRESSES (uid) = insn_current_address;
|
INSN_ADDRESSES (uid) = insn_current_address;
|
continue;
|
continue;
|
}
|
}
|
|
|
length_align = INSN_LENGTH_ALIGNMENT (insn);
|
length_align = INSN_LENGTH_ALIGNMENT (insn);
|
if (length_align < insn_current_align)
|
if (length_align < insn_current_align)
|
insn_current_align = length_align;
|
insn_current_align = length_align;
|
|
|
insn_last_address = INSN_ADDRESSES (uid);
|
insn_last_address = INSN_ADDRESSES (uid);
|
INSN_ADDRESSES (uid) = insn_current_address;
|
INSN_ADDRESSES (uid) = insn_current_address;
|
|
|
#ifdef CASE_VECTOR_SHORTEN_MODE
|
#ifdef CASE_VECTOR_SHORTEN_MODE
|
if (optimize && JUMP_P (insn)
|
if (optimize && JUMP_P (insn)
|
&& GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
|
&& GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
|
{
|
{
|
rtx body = PATTERN (insn);
|
rtx body = PATTERN (insn);
|
int old_length = insn_lengths[uid];
|
int old_length = insn_lengths[uid];
|
rtx rel_lab = XEXP (XEXP (body, 0), 0);
|
rtx rel_lab = XEXP (XEXP (body, 0), 0);
|
rtx min_lab = XEXP (XEXP (body, 2), 0);
|
rtx min_lab = XEXP (XEXP (body, 2), 0);
|
rtx max_lab = XEXP (XEXP (body, 3), 0);
|
rtx max_lab = XEXP (XEXP (body, 3), 0);
|
int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab));
|
int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab));
|
int min_addr = INSN_ADDRESSES (INSN_UID (min_lab));
|
int min_addr = INSN_ADDRESSES (INSN_UID (min_lab));
|
int max_addr = INSN_ADDRESSES (INSN_UID (max_lab));
|
int max_addr = INSN_ADDRESSES (INSN_UID (max_lab));
|
rtx prev;
|
rtx prev;
|
int rel_align = 0;
|
int rel_align = 0;
|
addr_diff_vec_flags flags;
|
addr_diff_vec_flags flags;
|
|
|
/* Avoid automatic aggregate initialization. */
|
/* Avoid automatic aggregate initialization. */
|
flags = ADDR_DIFF_VEC_FLAGS (body);
|
flags = ADDR_DIFF_VEC_FLAGS (body);
|
|
|
/* Try to find a known alignment for rel_lab. */
|
/* Try to find a known alignment for rel_lab. */
|
for (prev = rel_lab;
|
for (prev = rel_lab;
|
prev
|
prev
|
&& ! insn_lengths[INSN_UID (prev)]
|
&& ! insn_lengths[INSN_UID (prev)]
|
&& ! (varying_length[INSN_UID (prev)] & 1);
|
&& ! (varying_length[INSN_UID (prev)] & 1);
|
prev = PREV_INSN (prev))
|
prev = PREV_INSN (prev))
|
if (varying_length[INSN_UID (prev)] & 2)
|
if (varying_length[INSN_UID (prev)] & 2)
|
{
|
{
|
rel_align = LABEL_TO_ALIGNMENT (prev);
|
rel_align = LABEL_TO_ALIGNMENT (prev);
|
break;
|
break;
|
}
|
}
|
|
|
/* See the comment on addr_diff_vec_flags in rtl.h for the
|
/* See the comment on addr_diff_vec_flags in rtl.h for the
|
meaning of the flags values. base: REL_LAB vec: INSN */
|
meaning of the flags values. base: REL_LAB vec: INSN */
|
/* Anything after INSN has still addresses from the last
|
/* Anything after INSN has still addresses from the last
|
pass; adjust these so that they reflect our current
|
pass; adjust these so that they reflect our current
|
estimate for this pass. */
|
estimate for this pass. */
|
if (flags.base_after_vec)
|
if (flags.base_after_vec)
|
rel_addr += insn_current_address - insn_last_address;
|
rel_addr += insn_current_address - insn_last_address;
|
if (flags.min_after_vec)
|
if (flags.min_after_vec)
|
min_addr += insn_current_address - insn_last_address;
|
min_addr += insn_current_address - insn_last_address;
|
if (flags.max_after_vec)
|
if (flags.max_after_vec)
|
max_addr += insn_current_address - insn_last_address;
|
max_addr += insn_current_address - insn_last_address;
|
/* We want to know the worst case, i.e. lowest possible value
|
/* We want to know the worst case, i.e. lowest possible value
|
for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
|
for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
|
its offset is positive, and we have to be wary of code shrink;
|
its offset is positive, and we have to be wary of code shrink;
|
otherwise, it is negative, and we have to be vary of code
|
otherwise, it is negative, and we have to be vary of code
|
size increase. */
|
size increase. */
|
if (flags.min_after_base)
|
if (flags.min_after_base)
|
{
|
{
|
/* If INSN is between REL_LAB and MIN_LAB, the size
|
/* If INSN is between REL_LAB and MIN_LAB, the size
|
changes we are about to make can change the alignment
|
changes we are about to make can change the alignment
|
within the observed offset, therefore we have to break
|
within the observed offset, therefore we have to break
|
it up into two parts that are independent. */
|
it up into two parts that are independent. */
|
if (! flags.base_after_vec && flags.min_after_vec)
|
if (! flags.base_after_vec && flags.min_after_vec)
|
{
|
{
|
min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
|
min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
|
min_addr -= align_fuzz (insn, min_lab, 0, 0);
|
min_addr -= align_fuzz (insn, min_lab, 0, 0);
|
}
|
}
|
else
|
else
|
min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
|
min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
|
}
|
}
|
else
|
else
|
{
|
{
|
if (flags.base_after_vec && ! flags.min_after_vec)
|
if (flags.base_after_vec && ! flags.min_after_vec)
|
{
|
{
|
min_addr -= align_fuzz (min_lab, insn, 0, ~0);
|
min_addr -= align_fuzz (min_lab, insn, 0, ~0);
|
min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
|
min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
|
}
|
}
|
else
|
else
|
min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
|
min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
|
}
|
}
|
/* Likewise, determine the highest lowest possible value
|
/* Likewise, determine the highest lowest possible value
|
for the offset of MAX_LAB. */
|
for the offset of MAX_LAB. */
|
if (flags.max_after_base)
|
if (flags.max_after_base)
|
{
|
{
|
if (! flags.base_after_vec && flags.max_after_vec)
|
if (! flags.base_after_vec && flags.max_after_vec)
|
{
|
{
|
max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
|
max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
|
max_addr += align_fuzz (insn, max_lab, 0, ~0);
|
max_addr += align_fuzz (insn, max_lab, 0, ~0);
|
}
|
}
|
else
|
else
|
max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
|
max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
|
}
|
}
|
else
|
else
|
{
|
{
|
if (flags.base_after_vec && ! flags.max_after_vec)
|
if (flags.base_after_vec && ! flags.max_after_vec)
|
{
|
{
|
max_addr += align_fuzz (max_lab, insn, 0, 0);
|
max_addr += align_fuzz (max_lab, insn, 0, 0);
|
max_addr += align_fuzz (insn, rel_lab, 0, 0);
|
max_addr += align_fuzz (insn, rel_lab, 0, 0);
|
}
|
}
|
else
|
else
|
max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
|
max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
|
}
|
}
|
PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
|
PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
|
max_addr - rel_addr,
|
max_addr - rel_addr,
|
body));
|
body));
|
if (JUMP_TABLES_IN_TEXT_SECTION
|
if (JUMP_TABLES_IN_TEXT_SECTION
|
|| readonly_data_section == text_section)
|
|| readonly_data_section == text_section)
|
{
|
{
|
insn_lengths[uid]
|
insn_lengths[uid]
|
= (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
|
= (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
|
insn_current_address += insn_lengths[uid];
|
insn_current_address += insn_lengths[uid];
|
if (insn_lengths[uid] != old_length)
|
if (insn_lengths[uid] != old_length)
|
something_changed = 1;
|
something_changed = 1;
|
}
|
}
|
|
|
continue;
|
continue;
|
}
|
}
|
#endif /* CASE_VECTOR_SHORTEN_MODE */
|
#endif /* CASE_VECTOR_SHORTEN_MODE */
|
|
|
if (! (varying_length[uid]))
|
if (! (varying_length[uid]))
|
{
|
{
|
if (NONJUMP_INSN_P (insn)
|
if (NONJUMP_INSN_P (insn)
|
&& GET_CODE (PATTERN (insn)) == SEQUENCE)
|
&& GET_CODE (PATTERN (insn)) == SEQUENCE)
|
{
|
{
|
int i;
|
int i;
|
|
|
body = PATTERN (insn);
|
body = PATTERN (insn);
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
{
|
{
|
rtx inner_insn = XVECEXP (body, 0, i);
|
rtx inner_insn = XVECEXP (body, 0, i);
|
int inner_uid = INSN_UID (inner_insn);
|
int inner_uid = INSN_UID (inner_insn);
|
|
|
INSN_ADDRESSES (inner_uid) = insn_current_address;
|
INSN_ADDRESSES (inner_uid) = insn_current_address;
|
|
|
insn_current_address += insn_lengths[inner_uid];
|
insn_current_address += insn_lengths[inner_uid];
|
}
|
}
|
}
|
}
|
else
|
else
|
insn_current_address += insn_lengths[uid];
|
insn_current_address += insn_lengths[uid];
|
|
|
continue;
|
continue;
|
}
|
}
|
|
|
if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)
|
if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)
|
{
|
{
|
int i;
|
int i;
|
|
|
body = PATTERN (insn);
|
body = PATTERN (insn);
|
new_length = 0;
|
new_length = 0;
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
for (i = 0; i < XVECLEN (body, 0); i++)
|
{
|
{
|
rtx inner_insn = XVECEXP (body, 0, i);
|
rtx inner_insn = XVECEXP (body, 0, i);
|
int inner_uid = INSN_UID (inner_insn);
|
int inner_uid = INSN_UID (inner_insn);
|
int inner_length;
|
int inner_length;
|
|
|
INSN_ADDRESSES (inner_uid) = insn_current_address;
|
INSN_ADDRESSES (inner_uid) = insn_current_address;
|
|
|
/* insn_current_length returns 0 for insns with a
|
/* insn_current_length returns 0 for insns with a
|
non-varying length. */
|
non-varying length. */
|
if (! varying_length[inner_uid])
|
if (! varying_length[inner_uid])
|
inner_length = insn_lengths[inner_uid];
|
inner_length = insn_lengths[inner_uid];
|
else
|
else
|
inner_length = insn_current_length (inner_insn);
|
inner_length = insn_current_length (inner_insn);
|
|
|
if (inner_length != insn_lengths[inner_uid])
|
if (inner_length != insn_lengths[inner_uid])
|
{
|
{
|
insn_lengths[inner_uid] = inner_length;
|
insn_lengths[inner_uid] = inner_length;
|
something_changed = 1;
|
something_changed = 1;
|
}
|
}
|
insn_current_address += insn_lengths[inner_uid];
|
insn_current_address += insn_lengths[inner_uid];
|
new_length += inner_length;
|
new_length += inner_length;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
new_length = insn_current_length (insn);
|
new_length = insn_current_length (insn);
|
insn_current_address += new_length;
|
insn_current_address += new_length;
|
}
|
}
|
|
|
#ifdef ADJUST_INSN_LENGTH
|
#ifdef ADJUST_INSN_LENGTH
|
/* If needed, do any adjustment. */
|
/* If needed, do any adjustment. */
|
tmp_length = new_length;
|
tmp_length = new_length;
|
ADJUST_INSN_LENGTH (insn, new_length);
|
ADJUST_INSN_LENGTH (insn, new_length);
|
insn_current_address += (new_length - tmp_length);
|
insn_current_address += (new_length - tmp_length);
|
#endif
|
#endif
|
|
|
if (new_length != insn_lengths[uid])
|
if (new_length != insn_lengths[uid])
|
{
|
{
|
insn_lengths[uid] = new_length;
|
insn_lengths[uid] = new_length;
|
something_changed = 1;
|
something_changed = 1;
|
}
|
}
|
}
|
}
|
/* For a non-optimizing compile, do only a single pass. */
|
/* For a non-optimizing compile, do only a single pass. */
|
if (!optimize)
|
if (!optimize)
|
break;
|
break;
|
}
|
}
|
|
|
free (varying_length);
|
free (varying_length);
|
|
|
#endif /* HAVE_ATTR_length */
|
#endif /* HAVE_ATTR_length */
|
}
|
}
|
|
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
/* Given the body of an INSN known to be generated by an ASM statement, return
|
/* Given the body of an INSN known to be generated by an ASM statement, return
|
the number of machine instructions likely to be generated for this insn.
|
the number of machine instructions likely to be generated for this insn.
|
This is used to compute its length. */
|
This is used to compute its length. */
|
|
|
static int
|
static int
|
asm_insn_count (rtx body)
|
asm_insn_count (rtx body)
|
{
|
{
|
const char *template;
|
const char *template;
|
int count = 1;
|
int count = 1;
|
|
|
if (GET_CODE (body) == ASM_INPUT)
|
if (GET_CODE (body) == ASM_INPUT)
|
template = XSTR (body, 0);
|
template = XSTR (body, 0);
|
else
|
else
|
template = decode_asm_operands (body, NULL, NULL, NULL, NULL);
|
template = decode_asm_operands (body, NULL, NULL, NULL, NULL);
|
|
|
for (; *template; template++)
|
for (; *template; template++)
|
if (IS_ASM_LOGICAL_LINE_SEPARATOR (*template) || *template == '\n')
|
if (IS_ASM_LOGICAL_LINE_SEPARATOR (*template) || *template == '\n')
|
count++;
|
count++;
|
|
|
return count;
|
return count;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Output assembler code for the start of a function,
|
/* Output assembler code for the start of a function,
|
and initialize some of the variables in this file
|
and initialize some of the variables in this file
|
for the new function. The label for the function and associated
|
for the new function. The label for the function and associated
|
assembler pseudo-ops have already been output in `assemble_start_function'.
|
assembler pseudo-ops have already been output in `assemble_start_function'.
|
|
|
FIRST is the first insn of the rtl for the function being compiled.
|
FIRST is the first insn of the rtl for the function being compiled.
|
FILE is the file to write assembler code to.
|
FILE is the file to write assembler code to.
|
OPTIMIZE is nonzero if we should eliminate redundant
|
OPTIMIZE is nonzero if we should eliminate redundant
|
test and compare insns. */
|
test and compare insns. */
|
|
|
void
|
void
|
final_start_function (rtx first ATTRIBUTE_UNUSED, FILE *file,
|
final_start_function (rtx first ATTRIBUTE_UNUSED, FILE *file,
|
int optimize ATTRIBUTE_UNUSED)
|
int optimize ATTRIBUTE_UNUSED)
|
{
|
{
|
block_depth = 0;
|
block_depth = 0;
|
|
|
this_is_asm_operands = 0;
|
this_is_asm_operands = 0;
|
|
|
last_filename = locator_file (prologue_locator);
|
last_filename = locator_file (prologue_locator);
|
last_linenum = locator_line (prologue_locator);
|
last_linenum = locator_line (prologue_locator);
|
|
|
high_block_linenum = high_function_linenum = last_linenum;
|
high_block_linenum = high_function_linenum = last_linenum;
|
|
|
(*debug_hooks->begin_prologue) (last_linenum, last_filename);
|
(*debug_hooks->begin_prologue) (last_linenum, last_filename);
|
|
|
#if defined (DWARF2_UNWIND_INFO) || defined (TARGET_UNWIND_INFO)
|
#if defined (DWARF2_UNWIND_INFO) || defined (TARGET_UNWIND_INFO)
|
if (write_symbols != DWARF2_DEBUG && write_symbols != VMS_AND_DWARF2_DEBUG)
|
if (write_symbols != DWARF2_DEBUG && write_symbols != VMS_AND_DWARF2_DEBUG)
|
dwarf2out_begin_prologue (0, NULL);
|
dwarf2out_begin_prologue (0, NULL);
|
#endif
|
#endif
|
|
|
#ifdef LEAF_REG_REMAP
|
#ifdef LEAF_REG_REMAP
|
if (current_function_uses_only_leaf_regs)
|
if (current_function_uses_only_leaf_regs)
|
leaf_renumber_regs (first);
|
leaf_renumber_regs (first);
|
#endif
|
#endif
|
|
|
/* The Sun386i and perhaps other machines don't work right
|
/* The Sun386i and perhaps other machines don't work right
|
if the profiling code comes after the prologue. */
|
if the profiling code comes after the prologue. */
|
#ifdef PROFILE_BEFORE_PROLOGUE
|
#ifdef PROFILE_BEFORE_PROLOGUE
|
if (current_function_profile)
|
if (current_function_profile)
|
profile_function (file);
|
profile_function (file);
|
#endif /* PROFILE_BEFORE_PROLOGUE */
|
#endif /* PROFILE_BEFORE_PROLOGUE */
|
|
|
#if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
|
#if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
|
if (dwarf2out_do_frame ())
|
if (dwarf2out_do_frame ())
|
dwarf2out_frame_debug (NULL_RTX, false);
|
dwarf2out_frame_debug (NULL_RTX, false);
|
#endif
|
#endif
|
|
|
/* If debugging, assign block numbers to all of the blocks in this
|
/* If debugging, assign block numbers to all of the blocks in this
|
function. */
|
function. */
|
if (write_symbols)
|
if (write_symbols)
|
{
|
{
|
reemit_insn_block_notes ();
|
reemit_insn_block_notes ();
|
number_blocks (current_function_decl);
|
number_blocks (current_function_decl);
|
/* We never actually put out begin/end notes for the top-level
|
/* We never actually put out begin/end notes for the top-level
|
block in the function. But, conceptually, that block is
|
block in the function. But, conceptually, that block is
|
always needed. */
|
always needed. */
|
TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
|
TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
|
}
|
}
|
|
|
/* First output the function prologue: code to set up the stack frame. */
|
/* First output the function prologue: code to set up the stack frame. */
|
targetm.asm_out.function_prologue (file, get_frame_size ());
|
targetm.asm_out.function_prologue (file, get_frame_size ());
|
|
|
/* If the machine represents the prologue as RTL, the profiling code must
|
/* If the machine represents the prologue as RTL, the profiling code must
|
be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
|
be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
|
#ifdef HAVE_prologue
|
#ifdef HAVE_prologue
|
if (! HAVE_prologue)
|
if (! HAVE_prologue)
|
#endif
|
#endif
|
profile_after_prologue (file);
|
profile_after_prologue (file);
|
}
|
}
|
|
|
static void
|
static void
|
profile_after_prologue (FILE *file ATTRIBUTE_UNUSED)
|
profile_after_prologue (FILE *file ATTRIBUTE_UNUSED)
|
{
|
{
|
#ifndef PROFILE_BEFORE_PROLOGUE
|
#ifndef PROFILE_BEFORE_PROLOGUE
|
if (current_function_profile)
|
if (current_function_profile)
|
profile_function (file);
|
profile_function (file);
|
#endif /* not PROFILE_BEFORE_PROLOGUE */
|
#endif /* not PROFILE_BEFORE_PROLOGUE */
|
}
|
}
|
|
|
static void
|
static void
|
profile_function (FILE *file ATTRIBUTE_UNUSED)
|
profile_function (FILE *file ATTRIBUTE_UNUSED)
|
{
|
{
|
#ifndef NO_PROFILE_COUNTERS
|
#ifndef NO_PROFILE_COUNTERS
|
# define NO_PROFILE_COUNTERS 0
|
# define NO_PROFILE_COUNTERS 0
|
#endif
|
#endif
|
#if defined(ASM_OUTPUT_REG_PUSH)
|
#if defined(ASM_OUTPUT_REG_PUSH)
|
int sval = current_function_returns_struct;
|
int sval = current_function_returns_struct;
|
rtx svrtx = targetm.calls.struct_value_rtx (TREE_TYPE (current_function_decl), 1);
|
rtx svrtx = targetm.calls.struct_value_rtx (TREE_TYPE (current_function_decl), 1);
|
#if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
|
#if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
|
int cxt = cfun->static_chain_decl != NULL;
|
int cxt = cfun->static_chain_decl != NULL;
|
#endif
|
#endif
|
#endif /* ASM_OUTPUT_REG_PUSH */
|
#endif /* ASM_OUTPUT_REG_PUSH */
|
|
|
if (! NO_PROFILE_COUNTERS)
|
if (! NO_PROFILE_COUNTERS)
|
{
|
{
|
int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
|
int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
|
switch_to_section (data_section);
|
switch_to_section (data_section);
|
ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
|
ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
|
targetm.asm_out.internal_label (file, "LP", current_function_funcdef_no);
|
targetm.asm_out.internal_label (file, "LP", current_function_funcdef_no);
|
assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
|
assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
|
}
|
}
|
|
|
switch_to_section (current_function_section ());
|
switch_to_section (current_function_section ());
|
|
|
#if defined(ASM_OUTPUT_REG_PUSH)
|
#if defined(ASM_OUTPUT_REG_PUSH)
|
if (sval && svrtx != NULL_RTX && REG_P (svrtx))
|
if (sval && svrtx != NULL_RTX && REG_P (svrtx))
|
ASM_OUTPUT_REG_PUSH (file, REGNO (svrtx));
|
ASM_OUTPUT_REG_PUSH (file, REGNO (svrtx));
|
#endif
|
#endif
|
|
|
#if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
#if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
if (cxt)
|
if (cxt)
|
ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
|
ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
|
#else
|
#else
|
#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
if (cxt)
|
if (cxt)
|
{
|
{
|
ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
|
ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
|
}
|
}
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
FUNCTION_PROFILER (file, current_function_funcdef_no);
|
FUNCTION_PROFILER (file, current_function_funcdef_no);
|
|
|
#if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
#if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
if (cxt)
|
if (cxt)
|
ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
|
ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
|
#else
|
#else
|
#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
|
if (cxt)
|
if (cxt)
|
{
|
{
|
ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
|
ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
|
}
|
}
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
#if defined(ASM_OUTPUT_REG_PUSH)
|
#if defined(ASM_OUTPUT_REG_PUSH)
|
if (sval && svrtx != NULL_RTX && REG_P (svrtx))
|
if (sval && svrtx != NULL_RTX && REG_P (svrtx))
|
ASM_OUTPUT_REG_POP (file, REGNO (svrtx));
|
ASM_OUTPUT_REG_POP (file, REGNO (svrtx));
|
#endif
|
#endif
|
}
|
}
|
|
|
/* Output assembler code for the end of a function.
|
/* Output assembler code for the end of a function.
|
For clarity, args are same as those of `final_start_function'
|
For clarity, args are same as those of `final_start_function'
|
even though not all of them are needed. */
|
even though not all of them are needed. */
|
|
|
void
|
void
|
final_end_function (void)
|
final_end_function (void)
|
{
|
{
|
app_disable ();
|
app_disable ();
|
|
|
(*debug_hooks->end_function) (high_function_linenum);
|
(*debug_hooks->end_function) (high_function_linenum);
|
|
|
/* Finally, output the function epilogue:
|
/* Finally, output the function epilogue:
|
code to restore the stack frame and return to the caller. */
|
code to restore the stack frame and return to the caller. */
|
targetm.asm_out.function_epilogue (asm_out_file, get_frame_size ());
|
targetm.asm_out.function_epilogue (asm_out_file, get_frame_size ());
|
|
|
/* And debug output. */
|
/* And debug output. */
|
(*debug_hooks->end_epilogue) (last_linenum, last_filename);
|
(*debug_hooks->end_epilogue) (last_linenum, last_filename);
|
|
|
#if defined (DWARF2_UNWIND_INFO)
|
#if defined (DWARF2_UNWIND_INFO)
|
if (write_symbols != DWARF2_DEBUG && write_symbols != VMS_AND_DWARF2_DEBUG
|
if (write_symbols != DWARF2_DEBUG && write_symbols != VMS_AND_DWARF2_DEBUG
|
&& dwarf2out_do_frame ())
|
&& dwarf2out_do_frame ())
|
dwarf2out_end_epilogue (last_linenum, last_filename);
|
dwarf2out_end_epilogue (last_linenum, last_filename);
|
#endif
|
#endif
|
}
|
}
|
|
|
/* Output assembler code for some insns: all or part of a function.
|
/* Output assembler code for some insns: all or part of a function.
|
For description of args, see `final_start_function', above. */
|
For description of args, see `final_start_function', above. */
|
|
|
void
|
void
|
final (rtx first, FILE *file, int optimize)
|
final (rtx first, FILE *file, int optimize)
|
{
|
{
|
rtx insn;
|
rtx insn;
|
int max_uid = 0;
|
int max_uid = 0;
|
int seen = 0;
|
int seen = 0;
|
|
|
last_ignored_compare = 0;
|
last_ignored_compare = 0;
|
|
|
#ifdef SDB_DEBUGGING_INFO
|
#ifdef SDB_DEBUGGING_INFO
|
/* When producing SDB debugging info, delete troublesome line number
|
/* When producing SDB debugging info, delete troublesome line number
|
notes from inlined functions in other files as well as duplicate
|
notes from inlined functions in other files as well as duplicate
|
line number notes. */
|
line number notes. */
|
if (write_symbols == SDB_DEBUG)
|
if (write_symbols == SDB_DEBUG)
|
{
|
{
|
rtx last = 0;
|
rtx last = 0;
|
for (insn = first; insn; insn = NEXT_INSN (insn))
|
for (insn = first; insn; insn = NEXT_INSN (insn))
|
if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
|
if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
|
{
|
{
|
if (last != 0
|
if (last != 0
|
#ifdef USE_MAPPED_LOCATION
|
#ifdef USE_MAPPED_LOCATION
|
&& NOTE_SOURCE_LOCATION (insn) == NOTE_SOURCE_LOCATION (last)
|
&& NOTE_SOURCE_LOCATION (insn) == NOTE_SOURCE_LOCATION (last)
|
#else
|
#else
|
&& NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
|
&& NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
|
&& NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)
|
&& NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)
|
#endif
|
#endif
|
)
|
)
|
{
|
{
|
delete_insn (insn); /* Use delete_note. */
|
delete_insn (insn); /* Use delete_note. */
|
continue;
|
continue;
|
}
|
}
|
last = insn;
|
last = insn;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
for (insn = first; insn; insn = NEXT_INSN (insn))
|
for (insn = first; insn; insn = NEXT_INSN (insn))
|
{
|
{
|
if (INSN_UID (insn) > max_uid) /* Find largest UID. */
|
if (INSN_UID (insn) > max_uid) /* Find largest UID. */
|
max_uid = INSN_UID (insn);
|
max_uid = INSN_UID (insn);
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
/* If CC tracking across branches is enabled, record the insn which
|
/* If CC tracking across branches is enabled, record the insn which
|
jumps to each branch only reached from one place. */
|
jumps to each branch only reached from one place. */
|
if (optimize && JUMP_P (insn))
|
if (optimize && JUMP_P (insn))
|
{
|
{
|
rtx lab = JUMP_LABEL (insn);
|
rtx lab = JUMP_LABEL (insn);
|
if (lab && LABEL_NUSES (lab) == 1)
|
if (lab && LABEL_NUSES (lab) == 1)
|
{
|
{
|
LABEL_REFS (lab) = insn;
|
LABEL_REFS (lab) = insn;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
}
|
}
|
|
|
init_recog ();
|
init_recog ();
|
|
|
CC_STATUS_INIT;
|
CC_STATUS_INIT;
|
|
|
/* Output the insns. */
|
/* Output the insns. */
|
for (insn = NEXT_INSN (first); insn;)
|
for (insn = NEXT_INSN (first); insn;)
|
{
|
{
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
if ((unsigned) INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
|
if ((unsigned) INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
|
{
|
{
|
/* This can be triggered by bugs elsewhere in the compiler if
|
/* This can be triggered by bugs elsewhere in the compiler if
|
new insns are created after init_insn_lengths is called. */
|
new insns are created after init_insn_lengths is called. */
|
gcc_assert (NOTE_P (insn));
|
gcc_assert (NOTE_P (insn));
|
insn_current_address = -1;
|
insn_current_address = -1;
|
}
|
}
|
else
|
else
|
insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
|
insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
|
#endif /* HAVE_ATTR_length */
|
#endif /* HAVE_ATTR_length */
|
|
|
insn = final_scan_insn (insn, file, optimize, 0, &seen);
|
insn = final_scan_insn (insn, file, optimize, 0, &seen);
|
}
|
}
|
}
|
}
|
|
|
const char *
|
const char *
|
get_insn_template (int code, rtx insn)
|
get_insn_template (int code, rtx insn)
|
{
|
{
|
switch (insn_data[code].output_format)
|
switch (insn_data[code].output_format)
|
{
|
{
|
case INSN_OUTPUT_FORMAT_SINGLE:
|
case INSN_OUTPUT_FORMAT_SINGLE:
|
return insn_data[code].output.single;
|
return insn_data[code].output.single;
|
case INSN_OUTPUT_FORMAT_MULTI:
|
case INSN_OUTPUT_FORMAT_MULTI:
|
return insn_data[code].output.multi[which_alternative];
|
return insn_data[code].output.multi[which_alternative];
|
case INSN_OUTPUT_FORMAT_FUNCTION:
|
case INSN_OUTPUT_FORMAT_FUNCTION:
|
gcc_assert (insn);
|
gcc_assert (insn);
|
return (*insn_data[code].output.function) (recog_data.operand, insn);
|
return (*insn_data[code].output.function) (recog_data.operand, insn);
|
|
|
default:
|
default:
|
gcc_unreachable ();
|
gcc_unreachable ();
|
}
|
}
|
}
|
}
|
|
|
/* Emit the appropriate declaration for an alternate-entry-point
|
/* Emit the appropriate declaration for an alternate-entry-point
|
symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
|
symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
|
LABEL_KIND != LABEL_NORMAL.
|
LABEL_KIND != LABEL_NORMAL.
|
|
|
The case fall-through in this function is intentional. */
|
The case fall-through in this function is intentional. */
|
static void
|
static void
|
output_alternate_entry_point (FILE *file, rtx insn)
|
output_alternate_entry_point (FILE *file, rtx insn)
|
{
|
{
|
const char *name = LABEL_NAME (insn);
|
const char *name = LABEL_NAME (insn);
|
|
|
switch (LABEL_KIND (insn))
|
switch (LABEL_KIND (insn))
|
{
|
{
|
case LABEL_WEAK_ENTRY:
|
case LABEL_WEAK_ENTRY:
|
#ifdef ASM_WEAKEN_LABEL
|
#ifdef ASM_WEAKEN_LABEL
|
ASM_WEAKEN_LABEL (file, name);
|
ASM_WEAKEN_LABEL (file, name);
|
#endif
|
#endif
|
case LABEL_GLOBAL_ENTRY:
|
case LABEL_GLOBAL_ENTRY:
|
targetm.asm_out.globalize_label (file, name);
|
targetm.asm_out.globalize_label (file, name);
|
case LABEL_STATIC_ENTRY:
|
case LABEL_STATIC_ENTRY:
|
#ifdef ASM_OUTPUT_TYPE_DIRECTIVE
|
#ifdef ASM_OUTPUT_TYPE_DIRECTIVE
|
ASM_OUTPUT_TYPE_DIRECTIVE (file, name, "function");
|
ASM_OUTPUT_TYPE_DIRECTIVE (file, name, "function");
|
#endif
|
#endif
|
ASM_OUTPUT_LABEL (file, name);
|
ASM_OUTPUT_LABEL (file, name);
|
break;
|
break;
|
|
|
case LABEL_NORMAL:
|
case LABEL_NORMAL:
|
default:
|
default:
|
gcc_unreachable ();
|
gcc_unreachable ();
|
}
|
}
|
}
|
}
|
|
|
/* The final scan for one insn, INSN.
|
/* The final scan for one insn, INSN.
|
Args are same as in `final', except that INSN
|
Args are same as in `final', except that INSN
|
is the insn being scanned.
|
is the insn being scanned.
|
Value returned is the next insn to be scanned.
|
Value returned is the next insn to be scanned.
|
|
|
NOPEEPHOLES is the flag to disallow peephole processing (currently
|
NOPEEPHOLES is the flag to disallow peephole processing (currently
|
used for within delayed branch sequence output).
|
used for within delayed branch sequence output).
|
|
|
SEEN is used to track the end of the prologue, for emitting
|
SEEN is used to track the end of the prologue, for emitting
|
debug information. We force the emission of a line note after
|
debug information. We force the emission of a line note after
|
both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG, or
|
both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG, or
|
at the beginning of the second basic block, whichever comes
|
at the beginning of the second basic block, whichever comes
|
first. */
|
first. */
|
|
|
rtx
|
rtx
|
final_scan_insn (rtx insn, FILE *file, int optimize ATTRIBUTE_UNUSED,
|
final_scan_insn (rtx insn, FILE *file, int optimize ATTRIBUTE_UNUSED,
|
int nopeepholes ATTRIBUTE_UNUSED, int *seen)
|
int nopeepholes ATTRIBUTE_UNUSED, int *seen)
|
{
|
{
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
rtx set;
|
rtx set;
|
#endif
|
#endif
|
rtx next;
|
rtx next;
|
|
|
insn_counter++;
|
insn_counter++;
|
|
|
/* Ignore deleted insns. These can occur when we split insns (due to a
|
/* Ignore deleted insns. These can occur when we split insns (due to a
|
template of "#") while not optimizing. */
|
template of "#") while not optimizing. */
|
if (INSN_DELETED_P (insn))
|
if (INSN_DELETED_P (insn))
|
return NEXT_INSN (insn);
|
return NEXT_INSN (insn);
|
|
|
switch (GET_CODE (insn))
|
switch (GET_CODE (insn))
|
{
|
{
|
case NOTE:
|
case NOTE:
|
switch (NOTE_LINE_NUMBER (insn))
|
switch (NOTE_LINE_NUMBER (insn))
|
{
|
{
|
case NOTE_INSN_DELETED:
|
case NOTE_INSN_DELETED:
|
case NOTE_INSN_FUNCTION_END:
|
case NOTE_INSN_FUNCTION_END:
|
case NOTE_INSN_REPEATED_LINE_NUMBER:
|
case NOTE_INSN_REPEATED_LINE_NUMBER:
|
case NOTE_INSN_EXPECTED_VALUE:
|
case NOTE_INSN_EXPECTED_VALUE:
|
break;
|
break;
|
|
|
case NOTE_INSN_SWITCH_TEXT_SECTIONS:
|
case NOTE_INSN_SWITCH_TEXT_SECTIONS:
|
in_cold_section_p = !in_cold_section_p;
|
in_cold_section_p = !in_cold_section_p;
|
(*debug_hooks->switch_text_section) ();
|
(*debug_hooks->switch_text_section) ();
|
switch_to_section (current_function_section ());
|
switch_to_section (current_function_section ());
|
break;
|
break;
|
|
|
case NOTE_INSN_BASIC_BLOCK:
|
case NOTE_INSN_BASIC_BLOCK:
|
#ifdef TARGET_UNWIND_INFO
|
#ifdef TARGET_UNWIND_INFO
|
targetm.asm_out.unwind_emit (asm_out_file, insn);
|
targetm.asm_out.unwind_emit (asm_out_file, insn);
|
#endif
|
#endif
|
|
|
if (flag_debug_asm)
|
if (flag_debug_asm)
|
fprintf (asm_out_file, "\t%s basic block %d\n",
|
fprintf (asm_out_file, "\t%s basic block %d\n",
|
ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
|
ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
|
|
|
if ((*seen & (SEEN_EMITTED | SEEN_BB)) == SEEN_BB)
|
if ((*seen & (SEEN_EMITTED | SEEN_BB)) == SEEN_BB)
|
{
|
{
|
*seen |= SEEN_EMITTED;
|
*seen |= SEEN_EMITTED;
|
force_source_line = true;
|
force_source_line = true;
|
}
|
}
|
else
|
else
|
*seen |= SEEN_BB;
|
*seen |= SEEN_BB;
|
|
|
break;
|
break;
|
|
|
case NOTE_INSN_EH_REGION_BEG:
|
case NOTE_INSN_EH_REGION_BEG:
|
ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
|
ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
|
NOTE_EH_HANDLER (insn));
|
NOTE_EH_HANDLER (insn));
|
break;
|
break;
|
|
|
case NOTE_INSN_EH_REGION_END:
|
case NOTE_INSN_EH_REGION_END:
|
ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
|
ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
|
NOTE_EH_HANDLER (insn));
|
NOTE_EH_HANDLER (insn));
|
break;
|
break;
|
|
|
case NOTE_INSN_PROLOGUE_END:
|
case NOTE_INSN_PROLOGUE_END:
|
targetm.asm_out.function_end_prologue (file);
|
targetm.asm_out.function_end_prologue (file);
|
profile_after_prologue (file);
|
profile_after_prologue (file);
|
|
|
if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
|
if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
|
{
|
{
|
*seen |= SEEN_EMITTED;
|
*seen |= SEEN_EMITTED;
|
force_source_line = true;
|
force_source_line = true;
|
}
|
}
|
else
|
else
|
*seen |= SEEN_NOTE;
|
*seen |= SEEN_NOTE;
|
|
|
break;
|
break;
|
|
|
case NOTE_INSN_EPILOGUE_BEG:
|
case NOTE_INSN_EPILOGUE_BEG:
|
targetm.asm_out.function_begin_epilogue (file);
|
targetm.asm_out.function_begin_epilogue (file);
|
break;
|
break;
|
|
|
case NOTE_INSN_FUNCTION_BEG:
|
case NOTE_INSN_FUNCTION_BEG:
|
app_disable ();
|
app_disable ();
|
(*debug_hooks->end_prologue) (last_linenum, last_filename);
|
(*debug_hooks->end_prologue) (last_linenum, last_filename);
|
|
|
if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
|
if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
|
{
|
{
|
*seen |= SEEN_EMITTED;
|
*seen |= SEEN_EMITTED;
|
force_source_line = true;
|
force_source_line = true;
|
}
|
}
|
else
|
else
|
*seen |= SEEN_NOTE;
|
*seen |= SEEN_NOTE;
|
|
|
break;
|
break;
|
|
|
case NOTE_INSN_BLOCK_BEG:
|
case NOTE_INSN_BLOCK_BEG:
|
if (debug_info_level == DINFO_LEVEL_NORMAL
|
if (debug_info_level == DINFO_LEVEL_NORMAL
|
|| debug_info_level == DINFO_LEVEL_VERBOSE
|
|| debug_info_level == DINFO_LEVEL_VERBOSE
|
|| write_symbols == DWARF2_DEBUG
|
|| write_symbols == DWARF2_DEBUG
|
|| write_symbols == VMS_AND_DWARF2_DEBUG
|
|| write_symbols == VMS_AND_DWARF2_DEBUG
|
|| write_symbols == VMS_DEBUG)
|
|| write_symbols == VMS_DEBUG)
|
{
|
{
|
int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
|
int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
|
|
|
app_disable ();
|
app_disable ();
|
++block_depth;
|
++block_depth;
|
high_block_linenum = last_linenum;
|
high_block_linenum = last_linenum;
|
|
|
/* Output debugging info about the symbol-block beginning. */
|
/* Output debugging info about the symbol-block beginning. */
|
(*debug_hooks->begin_block) (last_linenum, n);
|
(*debug_hooks->begin_block) (last_linenum, n);
|
|
|
/* Mark this block as output. */
|
/* Mark this block as output. */
|
TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
|
TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
|
}
|
}
|
break;
|
break;
|
|
|
case NOTE_INSN_BLOCK_END:
|
case NOTE_INSN_BLOCK_END:
|
if (debug_info_level == DINFO_LEVEL_NORMAL
|
if (debug_info_level == DINFO_LEVEL_NORMAL
|
|| debug_info_level == DINFO_LEVEL_VERBOSE
|
|| debug_info_level == DINFO_LEVEL_VERBOSE
|
|| write_symbols == DWARF2_DEBUG
|
|| write_symbols == DWARF2_DEBUG
|
|| write_symbols == VMS_AND_DWARF2_DEBUG
|
|| write_symbols == VMS_AND_DWARF2_DEBUG
|
|| write_symbols == VMS_DEBUG)
|
|| write_symbols == VMS_DEBUG)
|
{
|
{
|
int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
|
int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
|
|
|
app_disable ();
|
app_disable ();
|
|
|
/* End of a symbol-block. */
|
/* End of a symbol-block. */
|
--block_depth;
|
--block_depth;
|
gcc_assert (block_depth >= 0);
|
gcc_assert (block_depth >= 0);
|
|
|
(*debug_hooks->end_block) (high_block_linenum, n);
|
(*debug_hooks->end_block) (high_block_linenum, n);
|
}
|
}
|
break;
|
break;
|
|
|
case NOTE_INSN_DELETED_LABEL:
|
case NOTE_INSN_DELETED_LABEL:
|
/* Emit the label. We may have deleted the CODE_LABEL because
|
/* Emit the label. We may have deleted the CODE_LABEL because
|
the label could be proved to be unreachable, though still
|
the label could be proved to be unreachable, though still
|
referenced (in the form of having its address taken. */
|
referenced (in the form of having its address taken. */
|
ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
|
ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
|
break;
|
break;
|
|
|
case NOTE_INSN_VAR_LOCATION:
|
case NOTE_INSN_VAR_LOCATION:
|
(*debug_hooks->var_location) (insn);
|
(*debug_hooks->var_location) (insn);
|
break;
|
break;
|
|
|
case 0:
|
case 0:
|
break;
|
break;
|
|
|
default:
|
default:
|
gcc_assert (NOTE_LINE_NUMBER (insn) > 0);
|
gcc_assert (NOTE_LINE_NUMBER (insn) > 0);
|
break;
|
break;
|
}
|
}
|
break;
|
break;
|
|
|
case BARRIER:
|
case BARRIER:
|
#if defined (DWARF2_UNWIND_INFO)
|
#if defined (DWARF2_UNWIND_INFO)
|
if (dwarf2out_do_frame ())
|
if (dwarf2out_do_frame ())
|
dwarf2out_frame_debug (insn, false);
|
dwarf2out_frame_debug (insn, false);
|
#endif
|
#endif
|
break;
|
break;
|
|
|
case CODE_LABEL:
|
case CODE_LABEL:
|
/* The target port might emit labels in the output function for
|
/* The target port might emit labels in the output function for
|
some insn, e.g. sh.c output_branchy_insn. */
|
some insn, e.g. sh.c output_branchy_insn. */
|
if (CODE_LABEL_NUMBER (insn) <= max_labelno)
|
if (CODE_LABEL_NUMBER (insn) <= max_labelno)
|
{
|
{
|
int align = LABEL_TO_ALIGNMENT (insn);
|
int align = LABEL_TO_ALIGNMENT (insn);
|
#ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
|
#ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
|
int max_skip = LABEL_TO_MAX_SKIP (insn);
|
int max_skip = LABEL_TO_MAX_SKIP (insn);
|
#endif
|
#endif
|
|
|
if (align && NEXT_INSN (insn))
|
if (align && NEXT_INSN (insn))
|
{
|
{
|
#ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
|
#ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
|
ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
|
ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
|
#else
|
#else
|
#ifdef ASM_OUTPUT_ALIGN_WITH_NOP
|
#ifdef ASM_OUTPUT_ALIGN_WITH_NOP
|
ASM_OUTPUT_ALIGN_WITH_NOP (file, align);
|
ASM_OUTPUT_ALIGN_WITH_NOP (file, align);
|
#else
|
#else
|
ASM_OUTPUT_ALIGN (file, align);
|
ASM_OUTPUT_ALIGN (file, align);
|
#endif
|
#endif
|
#endif
|
#endif
|
}
|
}
|
}
|
}
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
CC_STATUS_INIT;
|
CC_STATUS_INIT;
|
/* If this label is reached from only one place, set the condition
|
/* If this label is reached from only one place, set the condition
|
codes from the instruction just before the branch. */
|
codes from the instruction just before the branch. */
|
|
|
/* Disabled because some insns set cc_status in the C output code
|
/* Disabled because some insns set cc_status in the C output code
|
and NOTICE_UPDATE_CC alone can set incorrect status. */
|
and NOTICE_UPDATE_CC alone can set incorrect status. */
|
if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
|
if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
|
{
|
{
|
rtx jump = LABEL_REFS (insn);
|
rtx jump = LABEL_REFS (insn);
|
rtx barrier = prev_nonnote_insn (insn);
|
rtx barrier = prev_nonnote_insn (insn);
|
rtx prev;
|
rtx prev;
|
/* If the LABEL_REFS field of this label has been set to point
|
/* If the LABEL_REFS field of this label has been set to point
|
at a branch, the predecessor of the branch is a regular
|
at a branch, the predecessor of the branch is a regular
|
insn, and that branch is the only way to reach this label,
|
insn, and that branch is the only way to reach this label,
|
set the condition codes based on the branch and its
|
set the condition codes based on the branch and its
|
predecessor. */
|
predecessor. */
|
if (barrier && BARRIER_P (barrier)
|
if (barrier && BARRIER_P (barrier)
|
&& jump && JUMP_P (jump)
|
&& jump && JUMP_P (jump)
|
&& (prev = prev_nonnote_insn (jump))
|
&& (prev = prev_nonnote_insn (jump))
|
&& NONJUMP_INSN_P (prev))
|
&& NONJUMP_INSN_P (prev))
|
{
|
{
|
NOTICE_UPDATE_CC (PATTERN (prev), prev);
|
NOTICE_UPDATE_CC (PATTERN (prev), prev);
|
NOTICE_UPDATE_CC (PATTERN (jump), jump);
|
NOTICE_UPDATE_CC (PATTERN (jump), jump);
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
if (LABEL_NAME (insn))
|
if (LABEL_NAME (insn))
|
(*debug_hooks->label) (insn);
|
(*debug_hooks->label) (insn);
|
|
|
if (app_on)
|
if (app_on)
|
{
|
{
|
fputs (ASM_APP_OFF, file);
|
fputs (ASM_APP_OFF, file);
|
app_on = 0;
|
app_on = 0;
|
}
|
}
|
|
|
next = next_nonnote_insn (insn);
|
next = next_nonnote_insn (insn);
|
if (next != 0 && JUMP_P (next))
|
if (next != 0 && JUMP_P (next))
|
{
|
{
|
rtx nextbody = PATTERN (next);
|
rtx nextbody = PATTERN (next);
|
|
|
/* If this label is followed by a jump-table,
|
/* If this label is followed by a jump-table,
|
make sure we put the label in the read-only section. Also
|
make sure we put the label in the read-only section. Also
|
possibly write the label and jump table together. */
|
possibly write the label and jump table together. */
|
|
|
if (GET_CODE (nextbody) == ADDR_VEC
|
if (GET_CODE (nextbody) == ADDR_VEC
|
|| GET_CODE (nextbody) == ADDR_DIFF_VEC)
|
|| GET_CODE (nextbody) == ADDR_DIFF_VEC)
|
{
|
{
|
#if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
|
#if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
|
/* In this case, the case vector is being moved by the
|
/* In this case, the case vector is being moved by the
|
target, so don't output the label at all. Leave that
|
target, so don't output the label at all. Leave that
|
to the back end macros. */
|
to the back end macros. */
|
#else
|
#else
|
if (! JUMP_TABLES_IN_TEXT_SECTION)
|
if (! JUMP_TABLES_IN_TEXT_SECTION)
|
{
|
{
|
int log_align;
|
int log_align;
|
|
|
switch_to_section (targetm.asm_out.function_rodata_section
|
switch_to_section (targetm.asm_out.function_rodata_section
|
(current_function_decl));
|
(current_function_decl));
|
|
|
#ifdef ADDR_VEC_ALIGN
|
#ifdef ADDR_VEC_ALIGN
|
log_align = ADDR_VEC_ALIGN (next);
|
log_align = ADDR_VEC_ALIGN (next);
|
#else
|
#else
|
log_align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
|
log_align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
|
#endif
|
#endif
|
ASM_OUTPUT_ALIGN (file, log_align);
|
ASM_OUTPUT_ALIGN (file, log_align);
|
}
|
}
|
else
|
else
|
switch_to_section (current_function_section ());
|
switch_to_section (current_function_section ());
|
|
|
#ifdef ASM_OUTPUT_CASE_LABEL
|
#ifdef ASM_OUTPUT_CASE_LABEL
|
ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
|
ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
|
next);
|
next);
|
#else
|
#else
|
targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
|
targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
|
#endif
|
#endif
|
#endif
|
#endif
|
break;
|
break;
|
}
|
}
|
}
|
}
|
if (LABEL_ALT_ENTRY_P (insn))
|
if (LABEL_ALT_ENTRY_P (insn))
|
output_alternate_entry_point (file, insn);
|
output_alternate_entry_point (file, insn);
|
else
|
else
|
targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
|
targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
|
break;
|
break;
|
|
|
default:
|
default:
|
{
|
{
|
rtx body = PATTERN (insn);
|
rtx body = PATTERN (insn);
|
int insn_code_number;
|
int insn_code_number;
|
const char *template;
|
const char *template;
|
|
|
#ifdef HAVE_conditional_execution
|
#ifdef HAVE_conditional_execution
|
/* Reset this early so it is correct for ASM statements. */
|
/* Reset this early so it is correct for ASM statements. */
|
current_insn_predicate = NULL_RTX;
|
current_insn_predicate = NULL_RTX;
|
#endif
|
#endif
|
/* An INSN, JUMP_INSN or CALL_INSN.
|
/* An INSN, JUMP_INSN or CALL_INSN.
|
First check for special kinds that recog doesn't recognize. */
|
First check for special kinds that recog doesn't recognize. */
|
|
|
if (GET_CODE (body) == USE /* These are just declarations. */
|
if (GET_CODE (body) == USE /* These are just declarations. */
|
|| GET_CODE (body) == CLOBBER)
|
|| GET_CODE (body) == CLOBBER)
|
break;
|
break;
|
|
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
{
|
{
|
/* If there is a REG_CC_SETTER note on this insn, it means that
|
/* If there is a REG_CC_SETTER note on this insn, it means that
|
the setting of the condition code was done in the delay slot
|
the setting of the condition code was done in the delay slot
|
of the insn that branched here. So recover the cc status
|
of the insn that branched here. So recover the cc status
|
from the insn that set it. */
|
from the insn that set it. */
|
|
|
rtx note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
|
rtx note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
|
if (note)
|
if (note)
|
{
|
{
|
NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
|
NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
|
cc_prev_status = cc_status;
|
cc_prev_status = cc_status;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Detect insns that are really jump-tables
|
/* Detect insns that are really jump-tables
|
and output them as such. */
|
and output them as such. */
|
|
|
if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
|
if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
|
{
|
{
|
#if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
|
#if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
|
int vlen, idx;
|
int vlen, idx;
|
#endif
|
#endif
|
|
|
if (! JUMP_TABLES_IN_TEXT_SECTION)
|
if (! JUMP_TABLES_IN_TEXT_SECTION)
|
switch_to_section (targetm.asm_out.function_rodata_section
|
switch_to_section (targetm.asm_out.function_rodata_section
|
(current_function_decl));
|
(current_function_decl));
|
else
|
else
|
switch_to_section (current_function_section ());
|
switch_to_section (current_function_section ());
|
|
|
if (app_on)
|
if (app_on)
|
{
|
{
|
fputs (ASM_APP_OFF, file);
|
fputs (ASM_APP_OFF, file);
|
app_on = 0;
|
app_on = 0;
|
}
|
}
|
|
|
#if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
|
#if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
|
if (GET_CODE (body) == ADDR_VEC)
|
if (GET_CODE (body) == ADDR_VEC)
|
{
|
{
|
#ifdef ASM_OUTPUT_ADDR_VEC
|
#ifdef ASM_OUTPUT_ADDR_VEC
|
ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
|
ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
|
#else
|
#else
|
gcc_unreachable ();
|
gcc_unreachable ();
|
#endif
|
#endif
|
}
|
}
|
else
|
else
|
{
|
{
|
#ifdef ASM_OUTPUT_ADDR_DIFF_VEC
|
#ifdef ASM_OUTPUT_ADDR_DIFF_VEC
|
ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
|
ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
|
#else
|
#else
|
gcc_unreachable ();
|
gcc_unreachable ();
|
#endif
|
#endif
|
}
|
}
|
#else
|
#else
|
vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
|
vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
|
for (idx = 0; idx < vlen; idx++)
|
for (idx = 0; idx < vlen; idx++)
|
{
|
{
|
if (GET_CODE (body) == ADDR_VEC)
|
if (GET_CODE (body) == ADDR_VEC)
|
{
|
{
|
#ifdef ASM_OUTPUT_ADDR_VEC_ELT
|
#ifdef ASM_OUTPUT_ADDR_VEC_ELT
|
ASM_OUTPUT_ADDR_VEC_ELT
|
ASM_OUTPUT_ADDR_VEC_ELT
|
(file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
|
(file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
|
#else
|
#else
|
gcc_unreachable ();
|
gcc_unreachable ();
|
#endif
|
#endif
|
}
|
}
|
else
|
else
|
{
|
{
|
#ifdef ASM_OUTPUT_ADDR_DIFF_ELT
|
#ifdef ASM_OUTPUT_ADDR_DIFF_ELT
|
ASM_OUTPUT_ADDR_DIFF_ELT
|
ASM_OUTPUT_ADDR_DIFF_ELT
|
(file,
|
(file,
|
body,
|
body,
|
CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
|
CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
|
CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
|
CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
|
#else
|
#else
|
gcc_unreachable ();
|
gcc_unreachable ();
|
#endif
|
#endif
|
}
|
}
|
}
|
}
|
#ifdef ASM_OUTPUT_CASE_END
|
#ifdef ASM_OUTPUT_CASE_END
|
ASM_OUTPUT_CASE_END (file,
|
ASM_OUTPUT_CASE_END (file,
|
CODE_LABEL_NUMBER (PREV_INSN (insn)),
|
CODE_LABEL_NUMBER (PREV_INSN (insn)),
|
insn);
|
insn);
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
switch_to_section (current_function_section ());
|
switch_to_section (current_function_section ());
|
|
|
break;
|
break;
|
}
|
}
|
/* Output this line note if it is the first or the last line
|
/* Output this line note if it is the first or the last line
|
note in a row. */
|
note in a row. */
|
if (notice_source_line (insn))
|
if (notice_source_line (insn))
|
{
|
{
|
(*debug_hooks->source_line) (last_linenum, last_filename);
|
(*debug_hooks->source_line) (last_linenum, last_filename);
|
}
|
}
|
|
|
if (GET_CODE (body) == ASM_INPUT)
|
if (GET_CODE (body) == ASM_INPUT)
|
{
|
{
|
const char *string = XSTR (body, 0);
|
const char *string = XSTR (body, 0);
|
|
|
/* There's no telling what that did to the condition codes. */
|
/* There's no telling what that did to the condition codes. */
|
CC_STATUS_INIT;
|
CC_STATUS_INIT;
|
|
|
if (string[0])
|
if (string[0])
|
{
|
{
|
if (! app_on)
|
if (! app_on)
|
{
|
{
|
fputs (ASM_APP_ON, file);
|
fputs (ASM_APP_ON, file);
|
app_on = 1;
|
app_on = 1;
|
}
|
}
|
fprintf (asm_out_file, "\t%s\n", string);
|
fprintf (asm_out_file, "\t%s\n", string);
|
}
|
}
|
break;
|
break;
|
}
|
}
|
|
|
/* Detect `asm' construct with operands. */
|
/* Detect `asm' construct with operands. */
|
if (asm_noperands (body) >= 0)
|
if (asm_noperands (body) >= 0)
|
{
|
{
|
unsigned int noperands = asm_noperands (body);
|
unsigned int noperands = asm_noperands (body);
|
rtx *ops = alloca (noperands * sizeof (rtx));
|
rtx *ops = alloca (noperands * sizeof (rtx));
|
const char *string;
|
const char *string;
|
|
|
/* There's no telling what that did to the condition codes. */
|
/* There's no telling what that did to the condition codes. */
|
CC_STATUS_INIT;
|
CC_STATUS_INIT;
|
|
|
/* Get out the operand values. */
|
/* Get out the operand values. */
|
string = decode_asm_operands (body, ops, NULL, NULL, NULL);
|
string = decode_asm_operands (body, ops, NULL, NULL, NULL);
|
/* Inhibit dieing on what would otherwise be compiler bugs. */
|
/* Inhibit dieing on what would otherwise be compiler bugs. */
|
insn_noperands = noperands;
|
insn_noperands = noperands;
|
this_is_asm_operands = insn;
|
this_is_asm_operands = insn;
|
|
|
#ifdef FINAL_PRESCAN_INSN
|
#ifdef FINAL_PRESCAN_INSN
|
FINAL_PRESCAN_INSN (insn, ops, insn_noperands);
|
FINAL_PRESCAN_INSN (insn, ops, insn_noperands);
|
#endif
|
#endif
|
|
|
/* Output the insn using them. */
|
/* Output the insn using them. */
|
if (string[0])
|
if (string[0])
|
{
|
{
|
if (! app_on)
|
if (! app_on)
|
{
|
{
|
fputs (ASM_APP_ON, file);
|
fputs (ASM_APP_ON, file);
|
app_on = 1;
|
app_on = 1;
|
}
|
}
|
output_asm_insn (string, ops);
|
output_asm_insn (string, ops);
|
}
|
}
|
|
|
this_is_asm_operands = 0;
|
this_is_asm_operands = 0;
|
break;
|
break;
|
}
|
}
|
|
|
if (app_on)
|
if (app_on)
|
{
|
{
|
fputs (ASM_APP_OFF, file);
|
fputs (ASM_APP_OFF, file);
|
app_on = 0;
|
app_on = 0;
|
}
|
}
|
|
|
if (GET_CODE (body) == SEQUENCE)
|
if (GET_CODE (body) == SEQUENCE)
|
{
|
{
|
/* A delayed-branch sequence */
|
/* A delayed-branch sequence */
|
int i;
|
int i;
|
|
|
final_sequence = body;
|
final_sequence = body;
|
|
|
/* Record the delay slots' frame information before the branch.
|
/* Record the delay slots' frame information before the branch.
|
This is needed for delayed calls: see execute_cfa_program(). */
|
This is needed for delayed calls: see execute_cfa_program(). */
|
#if defined (DWARF2_UNWIND_INFO)
|
#if defined (DWARF2_UNWIND_INFO)
|
if (dwarf2out_do_frame ())
|
if (dwarf2out_do_frame ())
|
for (i = 1; i < XVECLEN (body, 0); i++)
|
for (i = 1; i < XVECLEN (body, 0); i++)
|
dwarf2out_frame_debug (XVECEXP (body, 0, i), false);
|
dwarf2out_frame_debug (XVECEXP (body, 0, i), false);
|
#endif
|
#endif
|
|
|
/* The first insn in this SEQUENCE might be a JUMP_INSN that will
|
/* The first insn in this SEQUENCE might be a JUMP_INSN that will
|
force the restoration of a comparison that was previously
|
force the restoration of a comparison that was previously
|
thought unnecessary. If that happens, cancel this sequence
|
thought unnecessary. If that happens, cancel this sequence
|
and cause that insn to be restored. */
|
and cause that insn to be restored. */
|
|
|
next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, 1, seen);
|
next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, 1, seen);
|
if (next != XVECEXP (body, 0, 1))
|
if (next != XVECEXP (body, 0, 1))
|
{
|
{
|
final_sequence = 0;
|
final_sequence = 0;
|
return next;
|
return next;
|
}
|
}
|
|
|
for (i = 1; i < XVECLEN (body, 0); i++)
|
for (i = 1; i < XVECLEN (body, 0); i++)
|
{
|
{
|
rtx insn = XVECEXP (body, 0, i);
|
rtx insn = XVECEXP (body, 0, i);
|
rtx next = NEXT_INSN (insn);
|
rtx next = NEXT_INSN (insn);
|
/* We loop in case any instruction in a delay slot gets
|
/* We loop in case any instruction in a delay slot gets
|
split. */
|
split. */
|
do
|
do
|
insn = final_scan_insn (insn, file, 0, 1, seen);
|
insn = final_scan_insn (insn, file, 0, 1, seen);
|
while (insn != next);
|
while (insn != next);
|
}
|
}
|
#ifdef DBR_OUTPUT_SEQEND
|
#ifdef DBR_OUTPUT_SEQEND
|
DBR_OUTPUT_SEQEND (file);
|
DBR_OUTPUT_SEQEND (file);
|
#endif
|
#endif
|
final_sequence = 0;
|
final_sequence = 0;
|
|
|
/* If the insn requiring the delay slot was a CALL_INSN, the
|
/* If the insn requiring the delay slot was a CALL_INSN, the
|
insns in the delay slot are actually executed before the
|
insns in the delay slot are actually executed before the
|
called function. Hence we don't preserve any CC-setting
|
called function. Hence we don't preserve any CC-setting
|
actions in these insns and the CC must be marked as being
|
actions in these insns and the CC must be marked as being
|
clobbered by the function. */
|
clobbered by the function. */
|
if (CALL_P (XVECEXP (body, 0, 0)))
|
if (CALL_P (XVECEXP (body, 0, 0)))
|
{
|
{
|
CC_STATUS_INIT;
|
CC_STATUS_INIT;
|
}
|
}
|
break;
|
break;
|
}
|
}
|
|
|
/* We have a real machine instruction as rtl. */
|
/* We have a real machine instruction as rtl. */
|
|
|
body = PATTERN (insn);
|
body = PATTERN (insn);
|
|
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
set = single_set (insn);
|
set = single_set (insn);
|
|
|
/* Check for redundant test and compare instructions
|
/* Check for redundant test and compare instructions
|
(when the condition codes are already set up as desired).
|
(when the condition codes are already set up as desired).
|
This is done only when optimizing; if not optimizing,
|
This is done only when optimizing; if not optimizing,
|
it should be possible for the user to alter a variable
|
it should be possible for the user to alter a variable
|
with the debugger in between statements
|
with the debugger in between statements
|
and the next statement should reexamine the variable
|
and the next statement should reexamine the variable
|
to compute the condition codes. */
|
to compute the condition codes. */
|
|
|
if (optimize)
|
if (optimize)
|
{
|
{
|
if (set
|
if (set
|
&& GET_CODE (SET_DEST (set)) == CC0
|
&& GET_CODE (SET_DEST (set)) == CC0
|
&& insn != last_ignored_compare)
|
&& insn != last_ignored_compare)
|
{
|
{
|
if (GET_CODE (SET_SRC (set)) == SUBREG)
|
if (GET_CODE (SET_SRC (set)) == SUBREG)
|
SET_SRC (set) = alter_subreg (&SET_SRC (set));
|
SET_SRC (set) = alter_subreg (&SET_SRC (set));
|
else if (GET_CODE (SET_SRC (set)) == COMPARE)
|
else if (GET_CODE (SET_SRC (set)) == COMPARE)
|
{
|
{
|
if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
|
if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
|
XEXP (SET_SRC (set), 0)
|
XEXP (SET_SRC (set), 0)
|
= alter_subreg (&XEXP (SET_SRC (set), 0));
|
= alter_subreg (&XEXP (SET_SRC (set), 0));
|
if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
|
if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
|
XEXP (SET_SRC (set), 1)
|
XEXP (SET_SRC (set), 1)
|
= alter_subreg (&XEXP (SET_SRC (set), 1));
|
= alter_subreg (&XEXP (SET_SRC (set), 1));
|
}
|
}
|
if ((cc_status.value1 != 0
|
if ((cc_status.value1 != 0
|
&& rtx_equal_p (SET_SRC (set), cc_status.value1))
|
&& rtx_equal_p (SET_SRC (set), cc_status.value1))
|
|| (cc_status.value2 != 0
|
|| (cc_status.value2 != 0
|
&& rtx_equal_p (SET_SRC (set), cc_status.value2)))
|
&& rtx_equal_p (SET_SRC (set), cc_status.value2)))
|
{
|
{
|
/* Don't delete insn if it has an addressing side-effect. */
|
/* Don't delete insn if it has an addressing side-effect. */
|
if (! FIND_REG_INC_NOTE (insn, NULL_RTX)
|
if (! FIND_REG_INC_NOTE (insn, NULL_RTX)
|
/* or if anything in it is volatile. */
|
/* or if anything in it is volatile. */
|
&& ! volatile_refs_p (PATTERN (insn)))
|
&& ! volatile_refs_p (PATTERN (insn)))
|
{
|
{
|
/* We don't really delete the insn; just ignore it. */
|
/* We don't really delete the insn; just ignore it. */
|
last_ignored_compare = insn;
|
last_ignored_compare = insn;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
/* If this is a conditional branch, maybe modify it
|
/* If this is a conditional branch, maybe modify it
|
if the cc's are in a nonstandard state
|
if the cc's are in a nonstandard state
|
so that it accomplishes the same thing that it would
|
so that it accomplishes the same thing that it would
|
do straightforwardly if the cc's were set up normally. */
|
do straightforwardly if the cc's were set up normally. */
|
|
|
if (cc_status.flags != 0
|
if (cc_status.flags != 0
|
&& JUMP_P (insn)
|
&& JUMP_P (insn)
|
&& GET_CODE (body) == SET
|
&& GET_CODE (body) == SET
|
&& SET_DEST (body) == pc_rtx
|
&& SET_DEST (body) == pc_rtx
|
&& GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
|
&& GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
|
&& COMPARISON_P (XEXP (SET_SRC (body), 0))
|
&& COMPARISON_P (XEXP (SET_SRC (body), 0))
|
&& XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx)
|
&& XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx)
|
{
|
{
|
/* This function may alter the contents of its argument
|
/* This function may alter the contents of its argument
|
and clear some of the cc_status.flags bits.
|
and clear some of the cc_status.flags bits.
|
It may also return 1 meaning condition now always true
|
It may also return 1 meaning condition now always true
|
or -1 meaning condition now always false
|
or -1 meaning condition now always false
|
or 2 meaning condition nontrivial but altered. */
|
or 2 meaning condition nontrivial but altered. */
|
int result = alter_cond (XEXP (SET_SRC (body), 0));
|
int result = alter_cond (XEXP (SET_SRC (body), 0));
|
/* If condition now has fixed value, replace the IF_THEN_ELSE
|
/* If condition now has fixed value, replace the IF_THEN_ELSE
|
with its then-operand or its else-operand. */
|
with its then-operand or its else-operand. */
|
if (result == 1)
|
if (result == 1)
|
SET_SRC (body) = XEXP (SET_SRC (body), 1);
|
SET_SRC (body) = XEXP (SET_SRC (body), 1);
|
if (result == -1)
|
if (result == -1)
|
SET_SRC (body) = XEXP (SET_SRC (body), 2);
|
SET_SRC (body) = XEXP (SET_SRC (body), 2);
|
|
|
/* The jump is now either unconditional or a no-op.
|
/* The jump is now either unconditional or a no-op.
|
If it has become a no-op, don't try to output it.
|
If it has become a no-op, don't try to output it.
|
(It would not be recognized.) */
|
(It would not be recognized.) */
|
if (SET_SRC (body) == pc_rtx)
|
if (SET_SRC (body) == pc_rtx)
|
{
|
{
|
delete_insn (insn);
|
delete_insn (insn);
|
break;
|
break;
|
}
|
}
|
else if (GET_CODE (SET_SRC (body)) == RETURN)
|
else if (GET_CODE (SET_SRC (body)) == RETURN)
|
/* Replace (set (pc) (return)) with (return). */
|
/* Replace (set (pc) (return)) with (return). */
|
PATTERN (insn) = body = SET_SRC (body);
|
PATTERN (insn) = body = SET_SRC (body);
|
|
|
/* Rerecognize the instruction if it has changed. */
|
/* Rerecognize the instruction if it has changed. */
|
if (result != 0)
|
if (result != 0)
|
INSN_CODE (insn) = -1;
|
INSN_CODE (insn) = -1;
|
}
|
}
|
|
|
/* Make same adjustments to instructions that examine the
|
/* Make same adjustments to instructions that examine the
|
condition codes without jumping and instructions that
|
condition codes without jumping and instructions that
|
handle conditional moves (if this machine has either one). */
|
handle conditional moves (if this machine has either one). */
|
|
|
if (cc_status.flags != 0
|
if (cc_status.flags != 0
|
&& set != 0)
|
&& set != 0)
|
{
|
{
|
rtx cond_rtx, then_rtx, else_rtx;
|
rtx cond_rtx, then_rtx, else_rtx;
|
|
|
if (!JUMP_P (insn)
|
if (!JUMP_P (insn)
|
&& GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
|
&& GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
|
{
|
{
|
cond_rtx = XEXP (SET_SRC (set), 0);
|
cond_rtx = XEXP (SET_SRC (set), 0);
|
then_rtx = XEXP (SET_SRC (set), 1);
|
then_rtx = XEXP (SET_SRC (set), 1);
|
else_rtx = XEXP (SET_SRC (set), 2);
|
else_rtx = XEXP (SET_SRC (set), 2);
|
}
|
}
|
else
|
else
|
{
|
{
|
cond_rtx = SET_SRC (set);
|
cond_rtx = SET_SRC (set);
|
then_rtx = const_true_rtx;
|
then_rtx = const_true_rtx;
|
else_rtx = const0_rtx;
|
else_rtx = const0_rtx;
|
}
|
}
|
|
|
switch (GET_CODE (cond_rtx))
|
switch (GET_CODE (cond_rtx))
|
{
|
{
|
case GTU:
|
case GTU:
|
case GT:
|
case GT:
|
case LTU:
|
case LTU:
|
case LT:
|
case LT:
|
case GEU:
|
case GEU:
|
case GE:
|
case GE:
|
case LEU:
|
case LEU:
|
case LE:
|
case LE:
|
case EQ:
|
case EQ:
|
case NE:
|
case NE:
|
{
|
{
|
int result;
|
int result;
|
if (XEXP (cond_rtx, 0) != cc0_rtx)
|
if (XEXP (cond_rtx, 0) != cc0_rtx)
|
break;
|
break;
|
result = alter_cond (cond_rtx);
|
result = alter_cond (cond_rtx);
|
if (result == 1)
|
if (result == 1)
|
validate_change (insn, &SET_SRC (set), then_rtx, 0);
|
validate_change (insn, &SET_SRC (set), then_rtx, 0);
|
else if (result == -1)
|
else if (result == -1)
|
validate_change (insn, &SET_SRC (set), else_rtx, 0);
|
validate_change (insn, &SET_SRC (set), else_rtx, 0);
|
else if (result == 2)
|
else if (result == 2)
|
INSN_CODE (insn) = -1;
|
INSN_CODE (insn) = -1;
|
if (SET_DEST (set) == SET_SRC (set))
|
if (SET_DEST (set) == SET_SRC (set))
|
delete_insn (insn);
|
delete_insn (insn);
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
#ifdef HAVE_peephole
|
#ifdef HAVE_peephole
|
/* Do machine-specific peephole optimizations if desired. */
|
/* Do machine-specific peephole optimizations if desired. */
|
|
|
if (optimize && !flag_no_peephole && !nopeepholes)
|
if (optimize && !flag_no_peephole && !nopeepholes)
|
{
|
{
|
rtx next = peephole (insn);
|
rtx next = peephole (insn);
|
/* When peepholing, if there were notes within the peephole,
|
/* When peepholing, if there were notes within the peephole,
|
emit them before the peephole. */
|
emit them before the peephole. */
|
if (next != 0 && next != NEXT_INSN (insn))
|
if (next != 0 && next != NEXT_INSN (insn))
|
{
|
{
|
rtx note, prev = PREV_INSN (insn);
|
rtx note, prev = PREV_INSN (insn);
|
|
|
for (note = NEXT_INSN (insn); note != next;
|
for (note = NEXT_INSN (insn); note != next;
|
note = NEXT_INSN (note))
|
note = NEXT_INSN (note))
|
final_scan_insn (note, file, optimize, nopeepholes, seen);
|
final_scan_insn (note, file, optimize, nopeepholes, seen);
|
|
|
/* Put the notes in the proper position for a later
|
/* Put the notes in the proper position for a later
|
rescan. For example, the SH target can do this
|
rescan. For example, the SH target can do this
|
when generating a far jump in a delayed branch
|
when generating a far jump in a delayed branch
|
sequence. */
|
sequence. */
|
note = NEXT_INSN (insn);
|
note = NEXT_INSN (insn);
|
PREV_INSN (note) = prev;
|
PREV_INSN (note) = prev;
|
NEXT_INSN (prev) = note;
|
NEXT_INSN (prev) = note;
|
NEXT_INSN (PREV_INSN (next)) = insn;
|
NEXT_INSN (PREV_INSN (next)) = insn;
|
PREV_INSN (insn) = PREV_INSN (next);
|
PREV_INSN (insn) = PREV_INSN (next);
|
NEXT_INSN (insn) = next;
|
NEXT_INSN (insn) = next;
|
PREV_INSN (next) = insn;
|
PREV_INSN (next) = insn;
|
}
|
}
|
|
|
/* PEEPHOLE might have changed this. */
|
/* PEEPHOLE might have changed this. */
|
body = PATTERN (insn);
|
body = PATTERN (insn);
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Try to recognize the instruction.
|
/* Try to recognize the instruction.
|
If successful, verify that the operands satisfy the
|
If successful, verify that the operands satisfy the
|
constraints for the instruction. Crash if they don't,
|
constraints for the instruction. Crash if they don't,
|
since `reload' should have changed them so that they do. */
|
since `reload' should have changed them so that they do. */
|
|
|
insn_code_number = recog_memoized (insn);
|
insn_code_number = recog_memoized (insn);
|
cleanup_subreg_operands (insn);
|
cleanup_subreg_operands (insn);
|
|
|
/* Dump the insn in the assembly for debugging. */
|
/* Dump the insn in the assembly for debugging. */
|
if (flag_dump_rtl_in_asm)
|
if (flag_dump_rtl_in_asm)
|
{
|
{
|
print_rtx_head = ASM_COMMENT_START;
|
print_rtx_head = ASM_COMMENT_START;
|
print_rtl_single (asm_out_file, insn);
|
print_rtl_single (asm_out_file, insn);
|
print_rtx_head = "";
|
print_rtx_head = "";
|
}
|
}
|
|
|
if (! constrain_operands_cached (1))
|
if (! constrain_operands_cached (1))
|
fatal_insn_not_found (insn);
|
fatal_insn_not_found (insn);
|
|
|
/* Some target machines need to prescan each insn before
|
/* Some target machines need to prescan each insn before
|
it is output. */
|
it is output. */
|
|
|
#ifdef FINAL_PRESCAN_INSN
|
#ifdef FINAL_PRESCAN_INSN
|
FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
|
FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
|
#endif
|
#endif
|
|
|
#ifdef HAVE_conditional_execution
|
#ifdef HAVE_conditional_execution
|
if (GET_CODE (PATTERN (insn)) == COND_EXEC)
|
if (GET_CODE (PATTERN (insn)) == COND_EXEC)
|
current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
|
current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
|
#endif
|
#endif
|
|
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
cc_prev_status = cc_status;
|
cc_prev_status = cc_status;
|
|
|
/* Update `cc_status' for this instruction.
|
/* Update `cc_status' for this instruction.
|
The instruction's output routine may change it further.
|
The instruction's output routine may change it further.
|
If the output routine for a jump insn needs to depend
|
If the output routine for a jump insn needs to depend
|
on the cc status, it should look at cc_prev_status. */
|
on the cc status, it should look at cc_prev_status. */
|
|
|
NOTICE_UPDATE_CC (body, insn);
|
NOTICE_UPDATE_CC (body, insn);
|
#endif
|
#endif
|
|
|
current_output_insn = debug_insn = insn;
|
current_output_insn = debug_insn = insn;
|
|
|
#if defined (DWARF2_UNWIND_INFO)
|
#if defined (DWARF2_UNWIND_INFO)
|
if (CALL_P (insn) && dwarf2out_do_frame ())
|
if (CALL_P (insn) && dwarf2out_do_frame ())
|
dwarf2out_frame_debug (insn, false);
|
dwarf2out_frame_debug (insn, false);
|
#endif
|
#endif
|
|
|
/* Find the proper template for this insn. */
|
/* Find the proper template for this insn. */
|
template = get_insn_template (insn_code_number, insn);
|
template = get_insn_template (insn_code_number, insn);
|
|
|
/* If the C code returns 0, it means that it is a jump insn
|
/* If the C code returns 0, it means that it is a jump insn
|
which follows a deleted test insn, and that test insn
|
which follows a deleted test insn, and that test insn
|
needs to be reinserted. */
|
needs to be reinserted. */
|
if (template == 0)
|
if (template == 0)
|
{
|
{
|
rtx prev;
|
rtx prev;
|
|
|
gcc_assert (prev_nonnote_insn (insn) == last_ignored_compare);
|
gcc_assert (prev_nonnote_insn (insn) == last_ignored_compare);
|
|
|
/* We have already processed the notes between the setter and
|
/* We have already processed the notes between the setter and
|
the user. Make sure we don't process them again, this is
|
the user. Make sure we don't process them again, this is
|
particularly important if one of the notes is a block
|
particularly important if one of the notes is a block
|
scope note or an EH note. */
|
scope note or an EH note. */
|
for (prev = insn;
|
for (prev = insn;
|
prev != last_ignored_compare;
|
prev != last_ignored_compare;
|
prev = PREV_INSN (prev))
|
prev = PREV_INSN (prev))
|
{
|
{
|
if (NOTE_P (prev))
|
if (NOTE_P (prev))
|
delete_insn (prev); /* Use delete_note. */
|
delete_insn (prev); /* Use delete_note. */
|
}
|
}
|
|
|
return prev;
|
return prev;
|
}
|
}
|
|
|
/* If the template is the string "#", it means that this insn must
|
/* If the template is the string "#", it means that this insn must
|
be split. */
|
be split. */
|
if (template[0] == '#' && template[1] == '\0')
|
if (template[0] == '#' && template[1] == '\0')
|
{
|
{
|
rtx new = try_split (body, insn, 0);
|
rtx new = try_split (body, insn, 0);
|
|
|
/* If we didn't split the insn, go away. */
|
/* If we didn't split the insn, go away. */
|
if (new == insn && PATTERN (new) == body)
|
if (new == insn && PATTERN (new) == body)
|
fatal_insn ("could not split insn", insn);
|
fatal_insn ("could not split insn", insn);
|
|
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
/* This instruction should have been split in shorten_branches,
|
/* This instruction should have been split in shorten_branches,
|
to ensure that we would have valid length info for the
|
to ensure that we would have valid length info for the
|
splitees. */
|
splitees. */
|
gcc_unreachable ();
|
gcc_unreachable ();
|
#endif
|
#endif
|
|
|
return new;
|
return new;
|
}
|
}
|
|
|
#ifdef TARGET_UNWIND_INFO
|
#ifdef TARGET_UNWIND_INFO
|
/* ??? This will put the directives in the wrong place if
|
/* ??? This will put the directives in the wrong place if
|
get_insn_template outputs assembly directly. However calling it
|
get_insn_template outputs assembly directly. However calling it
|
before get_insn_template breaks if the insns is split. */
|
before get_insn_template breaks if the insns is split. */
|
targetm.asm_out.unwind_emit (asm_out_file, insn);
|
targetm.asm_out.unwind_emit (asm_out_file, insn);
|
#endif
|
#endif
|
|
|
/* Output assembler code from the template. */
|
/* Output assembler code from the template. */
|
output_asm_insn (template, recog_data.operand);
|
output_asm_insn (template, recog_data.operand);
|
|
|
/* If necessary, report the effect that the instruction has on
|
/* If necessary, report the effect that the instruction has on
|
the unwind info. We've already done this for delay slots
|
the unwind info. We've already done this for delay slots
|
and call instructions. */
|
and call instructions. */
|
#if defined (DWARF2_UNWIND_INFO)
|
#if defined (DWARF2_UNWIND_INFO)
|
if (final_sequence == 0
|
if (final_sequence == 0
|
#if !defined (HAVE_prologue)
|
#if !defined (HAVE_prologue)
|
&& !ACCUMULATE_OUTGOING_ARGS
|
&& !ACCUMULATE_OUTGOING_ARGS
|
#endif
|
#endif
|
&& dwarf2out_do_frame ())
|
&& dwarf2out_do_frame ())
|
dwarf2out_frame_debug (insn, true);
|
dwarf2out_frame_debug (insn, true);
|
#endif
|
#endif
|
|
|
current_output_insn = debug_insn = 0;
|
current_output_insn = debug_insn = 0;
|
}
|
}
|
}
|
}
|
return NEXT_INSN (insn);
|
return NEXT_INSN (insn);
|
}
|
}
|
|
|
/* Return whether a source line note needs to be emitted before INSN. */
|
/* Return whether a source line note needs to be emitted before INSN. */
|
|
|
static bool
|
static bool
|
notice_source_line (rtx insn)
|
notice_source_line (rtx insn)
|
{
|
{
|
const char *filename = insn_file (insn);
|
const char *filename = insn_file (insn);
|
int linenum = insn_line (insn);
|
int linenum = insn_line (insn);
|
|
|
if (filename
|
if (filename
|
&& (force_source_line
|
&& (force_source_line
|
|| filename != last_filename
|
|| filename != last_filename
|
|| last_linenum != linenum))
|
|| last_linenum != linenum))
|
{
|
{
|
force_source_line = false;
|
force_source_line = false;
|
last_filename = filename;
|
last_filename = filename;
|
last_linenum = linenum;
|
last_linenum = linenum;
|
high_block_linenum = MAX (last_linenum, high_block_linenum);
|
high_block_linenum = MAX (last_linenum, high_block_linenum);
|
high_function_linenum = MAX (last_linenum, high_function_linenum);
|
high_function_linenum = MAX (last_linenum, high_function_linenum);
|
return true;
|
return true;
|
}
|
}
|
return false;
|
return false;
|
}
|
}
|
|
|
/* For each operand in INSN, simplify (subreg (reg)) so that it refers
|
/* For each operand in INSN, simplify (subreg (reg)) so that it refers
|
directly to the desired hard register. */
|
directly to the desired hard register. */
|
|
|
void
|
void
|
cleanup_subreg_operands (rtx insn)
|
cleanup_subreg_operands (rtx insn)
|
{
|
{
|
int i;
|
int i;
|
extract_insn_cached (insn);
|
extract_insn_cached (insn);
|
for (i = 0; i < recog_data.n_operands; i++)
|
for (i = 0; i < recog_data.n_operands; i++)
|
{
|
{
|
/* The following test cannot use recog_data.operand when testing
|
/* The following test cannot use recog_data.operand when testing
|
for a SUBREG: the underlying object might have been changed
|
for a SUBREG: the underlying object might have been changed
|
already if we are inside a match_operator expression that
|
already if we are inside a match_operator expression that
|
matches the else clause. Instead we test the underlying
|
matches the else clause. Instead we test the underlying
|
expression directly. */
|
expression directly. */
|
if (GET_CODE (*recog_data.operand_loc[i]) == SUBREG)
|
if (GET_CODE (*recog_data.operand_loc[i]) == SUBREG)
|
recog_data.operand[i] = alter_subreg (recog_data.operand_loc[i]);
|
recog_data.operand[i] = alter_subreg (recog_data.operand_loc[i]);
|
else if (GET_CODE (recog_data.operand[i]) == PLUS
|
else if (GET_CODE (recog_data.operand[i]) == PLUS
|
|| GET_CODE (recog_data.operand[i]) == MULT
|
|| GET_CODE (recog_data.operand[i]) == MULT
|
|| MEM_P (recog_data.operand[i]))
|
|| MEM_P (recog_data.operand[i]))
|
recog_data.operand[i] = walk_alter_subreg (recog_data.operand_loc[i]);
|
recog_data.operand[i] = walk_alter_subreg (recog_data.operand_loc[i]);
|
}
|
}
|
|
|
for (i = 0; i < recog_data.n_dups; i++)
|
for (i = 0; i < recog_data.n_dups; i++)
|
{
|
{
|
if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
|
if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
|
*recog_data.dup_loc[i] = alter_subreg (recog_data.dup_loc[i]);
|
*recog_data.dup_loc[i] = alter_subreg (recog_data.dup_loc[i]);
|
else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
|
else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
|
|| GET_CODE (*recog_data.dup_loc[i]) == MULT
|
|| GET_CODE (*recog_data.dup_loc[i]) == MULT
|
|| MEM_P (*recog_data.dup_loc[i]))
|
|| MEM_P (*recog_data.dup_loc[i]))
|
*recog_data.dup_loc[i] = walk_alter_subreg (recog_data.dup_loc[i]);
|
*recog_data.dup_loc[i] = walk_alter_subreg (recog_data.dup_loc[i]);
|
}
|
}
|
}
|
}
|
|
|
/* If X is a SUBREG, replace it with a REG or a MEM,
|
/* If X is a SUBREG, replace it with a REG or a MEM,
|
based on the thing it is a subreg of. */
|
based on the thing it is a subreg of. */
|
|
|
rtx
|
rtx
|
alter_subreg (rtx *xp)
|
alter_subreg (rtx *xp)
|
{
|
{
|
rtx x = *xp;
|
rtx x = *xp;
|
rtx y = SUBREG_REG (x);
|
rtx y = SUBREG_REG (x);
|
|
|
/* simplify_subreg does not remove subreg from volatile references.
|
/* simplify_subreg does not remove subreg from volatile references.
|
We are required to. */
|
We are required to. */
|
if (MEM_P (y))
|
if (MEM_P (y))
|
{
|
{
|
int offset = SUBREG_BYTE (x);
|
int offset = SUBREG_BYTE (x);
|
|
|
/* For paradoxical subregs on big-endian machines, SUBREG_BYTE
|
/* For paradoxical subregs on big-endian machines, SUBREG_BYTE
|
contains 0 instead of the proper offset. See simplify_subreg. */
|
contains 0 instead of the proper offset. See simplify_subreg. */
|
if (offset == 0
|
if (offset == 0
|
&& GET_MODE_SIZE (GET_MODE (y)) < GET_MODE_SIZE (GET_MODE (x)))
|
&& GET_MODE_SIZE (GET_MODE (y)) < GET_MODE_SIZE (GET_MODE (x)))
|
{
|
{
|
int difference = GET_MODE_SIZE (GET_MODE (y))
|
int difference = GET_MODE_SIZE (GET_MODE (y))
|
- GET_MODE_SIZE (GET_MODE (x));
|
- GET_MODE_SIZE (GET_MODE (x));
|
if (WORDS_BIG_ENDIAN)
|
if (WORDS_BIG_ENDIAN)
|
offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
|
offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
|
if (BYTES_BIG_ENDIAN)
|
if (BYTES_BIG_ENDIAN)
|
offset += difference % UNITS_PER_WORD;
|
offset += difference % UNITS_PER_WORD;
|
}
|
}
|
|
|
*xp = adjust_address (y, GET_MODE (x), offset);
|
*xp = adjust_address (y, GET_MODE (x), offset);
|
}
|
}
|
else
|
else
|
{
|
{
|
rtx new = simplify_subreg (GET_MODE (x), y, GET_MODE (y),
|
rtx new = simplify_subreg (GET_MODE (x), y, GET_MODE (y),
|
SUBREG_BYTE (x));
|
SUBREG_BYTE (x));
|
|
|
if (new != 0)
|
if (new != 0)
|
*xp = new;
|
*xp = new;
|
else if (REG_P (y))
|
else if (REG_P (y))
|
{
|
{
|
/* Simplify_subreg can't handle some REG cases, but we have to. */
|
/* Simplify_subreg can't handle some REG cases, but we have to. */
|
unsigned int regno = subreg_regno (x);
|
unsigned int regno = subreg_regno (x);
|
*xp = gen_rtx_REG_offset (y, GET_MODE (x), regno, SUBREG_BYTE (x));
|
*xp = gen_rtx_REG_offset (y, GET_MODE (x), regno, SUBREG_BYTE (x));
|
}
|
}
|
}
|
}
|
|
|
return *xp;
|
return *xp;
|
}
|
}
|
|
|
/* Do alter_subreg on all the SUBREGs contained in X. */
|
/* Do alter_subreg on all the SUBREGs contained in X. */
|
|
|
static rtx
|
static rtx
|
walk_alter_subreg (rtx *xp)
|
walk_alter_subreg (rtx *xp)
|
{
|
{
|
rtx x = *xp;
|
rtx x = *xp;
|
switch (GET_CODE (x))
|
switch (GET_CODE (x))
|
{
|
{
|
case PLUS:
|
case PLUS:
|
case MULT:
|
case MULT:
|
case AND:
|
case AND:
|
XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0));
|
XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0));
|
XEXP (x, 1) = walk_alter_subreg (&XEXP (x, 1));
|
XEXP (x, 1) = walk_alter_subreg (&XEXP (x, 1));
|
break;
|
break;
|
|
|
case MEM:
|
case MEM:
|
case ZERO_EXTEND:
|
case ZERO_EXTEND:
|
XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0));
|
XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0));
|
break;
|
break;
|
|
|
case SUBREG:
|
case SUBREG:
|
return alter_subreg (xp);
|
return alter_subreg (xp);
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
return *xp;
|
return *xp;
|
}
|
}
|
|
|
#ifdef HAVE_cc0
|
#ifdef HAVE_cc0
|
|
|
/* Given BODY, the body of a jump instruction, alter the jump condition
|
/* Given BODY, the body of a jump instruction, alter the jump condition
|
as required by the bits that are set in cc_status.flags.
|
as required by the bits that are set in cc_status.flags.
|
Not all of the bits there can be handled at this level in all cases.
|
Not all of the bits there can be handled at this level in all cases.
|
|
|
The value is normally 0.
|
The value is normally 0.
|
1 means that the condition has become always true.
|
1 means that the condition has become always true.
|
-1 means that the condition has become always false.
|
-1 means that the condition has become always false.
|
2 means that COND has been altered. */
|
2 means that COND has been altered. */
|
|
|
static int
|
static int
|
alter_cond (rtx cond)
|
alter_cond (rtx cond)
|
{
|
{
|
int value = 0;
|
int value = 0;
|
|
|
if (cc_status.flags & CC_REVERSED)
|
if (cc_status.flags & CC_REVERSED)
|
{
|
{
|
value = 2;
|
value = 2;
|
PUT_CODE (cond, swap_condition (GET_CODE (cond)));
|
PUT_CODE (cond, swap_condition (GET_CODE (cond)));
|
}
|
}
|
|
|
if (cc_status.flags & CC_INVERTED)
|
if (cc_status.flags & CC_INVERTED)
|
{
|
{
|
value = 2;
|
value = 2;
|
PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
|
PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
|
}
|
}
|
|
|
if (cc_status.flags & CC_NOT_POSITIVE)
|
if (cc_status.flags & CC_NOT_POSITIVE)
|
switch (GET_CODE (cond))
|
switch (GET_CODE (cond))
|
{
|
{
|
case LE:
|
case LE:
|
case LEU:
|
case LEU:
|
case GEU:
|
case GEU:
|
/* Jump becomes unconditional. */
|
/* Jump becomes unconditional. */
|
return 1;
|
return 1;
|
|
|
case GT:
|
case GT:
|
case GTU:
|
case GTU:
|
case LTU:
|
case LTU:
|
/* Jump becomes no-op. */
|
/* Jump becomes no-op. */
|
return -1;
|
return -1;
|
|
|
case GE:
|
case GE:
|
PUT_CODE (cond, EQ);
|
PUT_CODE (cond, EQ);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case LT:
|
case LT:
|
PUT_CODE (cond, NE);
|
PUT_CODE (cond, NE);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
if (cc_status.flags & CC_NOT_NEGATIVE)
|
if (cc_status.flags & CC_NOT_NEGATIVE)
|
switch (GET_CODE (cond))
|
switch (GET_CODE (cond))
|
{
|
{
|
case GE:
|
case GE:
|
case GEU:
|
case GEU:
|
/* Jump becomes unconditional. */
|
/* Jump becomes unconditional. */
|
return 1;
|
return 1;
|
|
|
case LT:
|
case LT:
|
case LTU:
|
case LTU:
|
/* Jump becomes no-op. */
|
/* Jump becomes no-op. */
|
return -1;
|
return -1;
|
|
|
case LE:
|
case LE:
|
case LEU:
|
case LEU:
|
PUT_CODE (cond, EQ);
|
PUT_CODE (cond, EQ);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case GT:
|
case GT:
|
case GTU:
|
case GTU:
|
PUT_CODE (cond, NE);
|
PUT_CODE (cond, NE);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
if (cc_status.flags & CC_NO_OVERFLOW)
|
if (cc_status.flags & CC_NO_OVERFLOW)
|
switch (GET_CODE (cond))
|
switch (GET_CODE (cond))
|
{
|
{
|
case GEU:
|
case GEU:
|
/* Jump becomes unconditional. */
|
/* Jump becomes unconditional. */
|
return 1;
|
return 1;
|
|
|
case LEU:
|
case LEU:
|
PUT_CODE (cond, EQ);
|
PUT_CODE (cond, EQ);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case GTU:
|
case GTU:
|
PUT_CODE (cond, NE);
|
PUT_CODE (cond, NE);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case LTU:
|
case LTU:
|
/* Jump becomes no-op. */
|
/* Jump becomes no-op. */
|
return -1;
|
return -1;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
|
if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
|
switch (GET_CODE (cond))
|
switch (GET_CODE (cond))
|
{
|
{
|
default:
|
default:
|
gcc_unreachable ();
|
gcc_unreachable ();
|
|
|
case NE:
|
case NE:
|
PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
|
PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case EQ:
|
case EQ:
|
PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
|
PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
}
|
}
|
|
|
if (cc_status.flags & CC_NOT_SIGNED)
|
if (cc_status.flags & CC_NOT_SIGNED)
|
/* The flags are valid if signed condition operators are converted
|
/* The flags are valid if signed condition operators are converted
|
to unsigned. */
|
to unsigned. */
|
switch (GET_CODE (cond))
|
switch (GET_CODE (cond))
|
{
|
{
|
case LE:
|
case LE:
|
PUT_CODE (cond, LEU);
|
PUT_CODE (cond, LEU);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case LT:
|
case LT:
|
PUT_CODE (cond, LTU);
|
PUT_CODE (cond, LTU);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case GT:
|
case GT:
|
PUT_CODE (cond, GTU);
|
PUT_CODE (cond, GTU);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
case GE:
|
case GE:
|
PUT_CODE (cond, GEU);
|
PUT_CODE (cond, GEU);
|
value = 2;
|
value = 2;
|
break;
|
break;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
return value;
|
return value;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Report inconsistency between the assembler template and the operands.
|
/* Report inconsistency between the assembler template and the operands.
|
In an `asm', it's the user's fault; otherwise, the compiler's fault. */
|
In an `asm', it's the user's fault; otherwise, the compiler's fault. */
|
|
|
void
|
void
|
output_operand_lossage (const char *cmsgid, ...)
|
output_operand_lossage (const char *cmsgid, ...)
|
{
|
{
|
char *fmt_string;
|
char *fmt_string;
|
char *new_message;
|
char *new_message;
|
const char *pfx_str;
|
const char *pfx_str;
|
va_list ap;
|
va_list ap;
|
|
|
va_start (ap, cmsgid);
|
va_start (ap, cmsgid);
|
|
|
pfx_str = this_is_asm_operands ? _("invalid 'asm': ") : "output_operand: ";
|
pfx_str = this_is_asm_operands ? _("invalid 'asm': ") : "output_operand: ";
|
asprintf (&fmt_string, "%s%s", pfx_str, _(cmsgid));
|
asprintf (&fmt_string, "%s%s", pfx_str, _(cmsgid));
|
vasprintf (&new_message, fmt_string, ap);
|
vasprintf (&new_message, fmt_string, ap);
|
|
|
if (this_is_asm_operands)
|
if (this_is_asm_operands)
|
error_for_asm (this_is_asm_operands, "%s", new_message);
|
error_for_asm (this_is_asm_operands, "%s", new_message);
|
else
|
else
|
internal_error ("%s", new_message);
|
internal_error ("%s", new_message);
|
|
|
free (fmt_string);
|
free (fmt_string);
|
free (new_message);
|
free (new_message);
|
va_end (ap);
|
va_end (ap);
|
}
|
}
|
|
|
/* Output of assembler code from a template, and its subroutines. */
|
/* Output of assembler code from a template, and its subroutines. */
|
|
|
/* Annotate the assembly with a comment describing the pattern and
|
/* Annotate the assembly with a comment describing the pattern and
|
alternative used. */
|
alternative used. */
|
|
|
static void
|
static void
|
output_asm_name (void)
|
output_asm_name (void)
|
{
|
{
|
if (debug_insn)
|
if (debug_insn)
|
{
|
{
|
int num = INSN_CODE (debug_insn);
|
int num = INSN_CODE (debug_insn);
|
fprintf (asm_out_file, "\t%s %d\t%s",
|
fprintf (asm_out_file, "\t%s %d\t%s",
|
ASM_COMMENT_START, INSN_UID (debug_insn),
|
ASM_COMMENT_START, INSN_UID (debug_insn),
|
insn_data[num].name);
|
insn_data[num].name);
|
if (insn_data[num].n_alternatives > 1)
|
if (insn_data[num].n_alternatives > 1)
|
fprintf (asm_out_file, "/%d", which_alternative + 1);
|
fprintf (asm_out_file, "/%d", which_alternative + 1);
|
#ifdef HAVE_ATTR_length
|
#ifdef HAVE_ATTR_length
|
fprintf (asm_out_file, "\t[length = %d]",
|
fprintf (asm_out_file, "\t[length = %d]",
|
get_attr_length (debug_insn));
|
get_attr_length (debug_insn));
|
#endif
|
#endif
|
/* Clear this so only the first assembler insn
|
/* Clear this so only the first assembler insn
|
of any rtl insn will get the special comment for -dp. */
|
of any rtl insn will get the special comment for -dp. */
|
debug_insn = 0;
|
debug_insn = 0;
|
}
|
}
|
}
|
}
|
|
|
/* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
|
/* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
|
or its address, return that expr . Set *PADDRESSP to 1 if the expr
|
or its address, return that expr . Set *PADDRESSP to 1 if the expr
|
corresponds to the address of the object and 0 if to the object. */
|
corresponds to the address of the object and 0 if to the object. */
|
|
|
static tree
|
static tree
|
get_mem_expr_from_op (rtx op, int *paddressp)
|
get_mem_expr_from_op (rtx op, int *paddressp)
|
{
|
{
|
tree expr;
|
tree expr;
|
int inner_addressp;
|
int inner_addressp;
|
|
|
*paddressp = 0;
|
*paddressp = 0;
|
|
|
if (REG_P (op))
|
if (REG_P (op))
|
return REG_EXPR (op);
|
return REG_EXPR (op);
|
else if (!MEM_P (op))
|
else if (!MEM_P (op))
|
return 0;
|
return 0;
|
|
|
if (MEM_EXPR (op) != 0)
|
if (MEM_EXPR (op) != 0)
|
return MEM_EXPR (op);
|
return MEM_EXPR (op);
|
|
|
/* Otherwise we have an address, so indicate it and look at the address. */
|
/* Otherwise we have an address, so indicate it and look at the address. */
|
*paddressp = 1;
|
*paddressp = 1;
|
op = XEXP (op, 0);
|
op = XEXP (op, 0);
|
|
|
/* First check if we have a decl for the address, then look at the right side
|
/* First check if we have a decl for the address, then look at the right side
|
if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
|
if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
|
But don't allow the address to itself be indirect. */
|
But don't allow the address to itself be indirect. */
|
if ((expr = get_mem_expr_from_op (op, &inner_addressp)) && ! inner_addressp)
|
if ((expr = get_mem_expr_from_op (op, &inner_addressp)) && ! inner_addressp)
|
return expr;
|
return expr;
|
else if (GET_CODE (op) == PLUS
|
else if (GET_CODE (op) == PLUS
|
&& (expr = get_mem_expr_from_op (XEXP (op, 1), &inner_addressp)))
|
&& (expr = get_mem_expr_from_op (XEXP (op, 1), &inner_addressp)))
|
return expr;
|
return expr;
|
|
|
while (GET_RTX_CLASS (GET_CODE (op)) == RTX_UNARY
|
while (GET_RTX_CLASS (GET_CODE (op)) == RTX_UNARY
|
|| GET_RTX_CLASS (GET_CODE (op)) == RTX_BIN_ARITH)
|
|| GET_RTX_CLASS (GET_CODE (op)) == RTX_BIN_ARITH)
|
op = XEXP (op, 0);
|
op = XEXP (op, 0);
|
|
|
expr = get_mem_expr_from_op (op, &inner_addressp);
|
expr = get_mem_expr_from_op (op, &inner_addressp);
|
return inner_addressp ? 0 : expr;
|
return inner_addressp ? 0 : expr;
|
}
|
}
|
|
|
/* Output operand names for assembler instructions. OPERANDS is the
|
/* Output operand names for assembler instructions. OPERANDS is the
|
operand vector, OPORDER is the order to write the operands, and NOPS
|
operand vector, OPORDER is the order to write the operands, and NOPS
|
is the number of operands to write. */
|
is the number of operands to write. */
|
|
|
static void
|
static void
|
output_asm_operand_names (rtx *operands, int *oporder, int nops)
|
output_asm_operand_names (rtx *operands, int *oporder, int nops)
|
{
|
{
|
int wrote = 0;
|
int wrote = 0;
|
int i;
|
int i;
|
|
|
for (i = 0; i < nops; i++)
|
for (i = 0; i < nops; i++)
|
{
|
{
|
int addressp;
|
int addressp;
|
rtx op = operands[oporder[i]];
|
rtx op = operands[oporder[i]];
|
tree expr = get_mem_expr_from_op (op, &addressp);
|
tree expr = get_mem_expr_from_op (op, &addressp);
|
|
|
fprintf (asm_out_file, "%c%s",
|
fprintf (asm_out_file, "%c%s",
|
wrote ? ',' : '\t', wrote ? "" : ASM_COMMENT_START);
|
wrote ? ',' : '\t', wrote ? "" : ASM_COMMENT_START);
|
wrote = 1;
|
wrote = 1;
|
if (expr)
|
if (expr)
|
{
|
{
|
fprintf (asm_out_file, "%s",
|
fprintf (asm_out_file, "%s",
|
addressp ? "*" : "");
|
addressp ? "*" : "");
|
print_mem_expr (asm_out_file, expr);
|
print_mem_expr (asm_out_file, expr);
|
wrote = 1;
|
wrote = 1;
|
}
|
}
|
else if (REG_P (op) && ORIGINAL_REGNO (op)
|
else if (REG_P (op) && ORIGINAL_REGNO (op)
|
&& ORIGINAL_REGNO (op) != REGNO (op))
|
&& ORIGINAL_REGNO (op) != REGNO (op))
|
fprintf (asm_out_file, " tmp%i", ORIGINAL_REGNO (op));
|
fprintf (asm_out_file, " tmp%i", ORIGINAL_REGNO (op));
|
}
|
}
|
}
|
}
|
|
|
/* Output text from TEMPLATE to the assembler output file,
|
/* Output text from TEMPLATE to the assembler output file,
|
obeying %-directions to substitute operands taken from
|
obeying %-directions to substitute operands taken from
|
the vector OPERANDS.
|
the vector OPERANDS.
|
|
|
%N (for N a digit) means print operand N in usual manner.
|
%N (for N a digit) means print operand N in usual manner.
|
%lN means require operand N to be a CODE_LABEL or LABEL_REF
|
%lN means require operand N to be a CODE_LABEL or LABEL_REF
|
and print the label name with no punctuation.
|
and print the label name with no punctuation.
|
%cN means require operand N to be a constant
|
%cN means require operand N to be a constant
|
and print the constant expression with no punctuation.
|
and print the constant expression with no punctuation.
|
%aN means expect operand N to be a memory address
|
%aN means expect operand N to be a memory address
|
(not a memory reference!) and print a reference
|
(not a memory reference!) and print a reference
|
to that address.
|
to that address.
|
%nN means expect operand N to be a constant
|
%nN means expect operand N to be a constant
|
and print a constant expression for minus the value
|
and print a constant expression for minus the value
|
of the operand, with no other punctuation. */
|
of the operand, with no other punctuation. */
|
|
|
void
|
void
|
output_asm_insn (const char *template, rtx *operands)
|
output_asm_insn (const char *template, rtx *operands)
|
{
|
{
|
const char *p;
|
const char *p;
|
int c;
|
int c;
|
#ifdef ASSEMBLER_DIALECT
|
#ifdef ASSEMBLER_DIALECT
|
int dialect = 0;
|
int dialect = 0;
|
#endif
|
#endif
|
int oporder[MAX_RECOG_OPERANDS];
|
int oporder[MAX_RECOG_OPERANDS];
|
char opoutput[MAX_RECOG_OPERANDS];
|
char opoutput[MAX_RECOG_OPERANDS];
|
int ops = 0;
|
int ops = 0;
|
|
|
/* An insn may return a null string template
|
/* An insn may return a null string template
|
in a case where no assembler code is needed. */
|
in a case where no assembler code is needed. */
|
if (*template == 0)
|
if (*template == 0)
|
return;
|
return;
|
|
|
memset (opoutput, 0, sizeof opoutput);
|
memset (opoutput, 0, sizeof opoutput);
|
p = template;
|
p = template;
|
putc ('\t', asm_out_file);
|
putc ('\t', asm_out_file);
|
|
|
#ifdef ASM_OUTPUT_OPCODE
|
#ifdef ASM_OUTPUT_OPCODE
|
ASM_OUTPUT_OPCODE (asm_out_file, p);
|
ASM_OUTPUT_OPCODE (asm_out_file, p);
|
#endif
|
#endif
|
|
|
while ((c = *p++))
|
while ((c = *p++))
|
switch (c)
|
switch (c)
|
{
|
{
|
case '\n':
|
case '\n':
|
if (flag_verbose_asm)
|
if (flag_verbose_asm)
|
output_asm_operand_names (operands, oporder, ops);
|
output_asm_operand_names (operands, oporder, ops);
|
if (flag_print_asm_name)
|
if (flag_print_asm_name)
|
output_asm_name ();
|
output_asm_name ();
|
|
|
ops = 0;
|
ops = 0;
|
memset (opoutput, 0, sizeof opoutput);
|
memset (opoutput, 0, sizeof opoutput);
|
|
|
putc (c, asm_out_file);
|
putc (c, asm_out_file);
|
#ifdef ASM_OUTPUT_OPCODE
|
#ifdef ASM_OUTPUT_OPCODE
|
while ((c = *p) == '\t')
|
while ((c = *p) == '\t')
|
{
|
{
|
putc (c, asm_out_file);
|
putc (c, asm_out_file);
|
p++;
|
p++;
|
}
|
}
|
ASM_OUTPUT_OPCODE (asm_out_file, p);
|
ASM_OUTPUT_OPCODE (asm_out_file, p);
|
#endif
|
#endif
|
break;
|
break;
|
|
|
#ifdef ASSEMBLER_DIALECT
|
#ifdef ASSEMBLER_DIALECT
|
case '{':
|
case '{':
|
{
|
{
|
int i;
|
int i;
|
|
|
if (dialect)
|
if (dialect)
|
output_operand_lossage ("nested assembly dialect alternatives");
|
output_operand_lossage ("nested assembly dialect alternatives");
|
else
|
else
|
dialect = 1;
|
dialect = 1;
|
|
|
/* If we want the first dialect, do nothing. Otherwise, skip
|
/* If we want the first dialect, do nothing. Otherwise, skip
|
DIALECT_NUMBER of strings ending with '|'. */
|
DIALECT_NUMBER of strings ending with '|'. */
|
for (i = 0; i < dialect_number; i++)
|
for (i = 0; i < dialect_number; i++)
|
{
|
{
|
while (*p && *p != '}' && *p++ != '|')
|
while (*p && *p != '}' && *p++ != '|')
|
;
|
;
|
if (*p == '}')
|
if (*p == '}')
|
break;
|
break;
|
if (*p == '|')
|
if (*p == '|')
|
p++;
|
p++;
|
}
|
}
|
|
|
if (*p == '\0')
|
if (*p == '\0')
|
output_operand_lossage ("unterminated assembly dialect alternative");
|
output_operand_lossage ("unterminated assembly dialect alternative");
|
}
|
}
|
break;
|
break;
|
|
|
case '|':
|
case '|':
|
if (dialect)
|
if (dialect)
|
{
|
{
|
/* Skip to close brace. */
|
/* Skip to close brace. */
|
do
|
do
|
{
|
{
|
if (*p == '\0')
|
if (*p == '\0')
|
{
|
{
|
output_operand_lossage ("unterminated assembly dialect alternative");
|
output_operand_lossage ("unterminated assembly dialect alternative");
|
break;
|
break;
|
}
|
}
|
}
|
}
|
while (*p++ != '}');
|
while (*p++ != '}');
|
dialect = 0;
|
dialect = 0;
|
}
|
}
|
else
|
else
|
putc (c, asm_out_file);
|
putc (c, asm_out_file);
|
break;
|
break;
|
|
|
case '}':
|
case '}':
|
if (! dialect)
|
if (! dialect)
|
putc (c, asm_out_file);
|
putc (c, asm_out_file);
|
dialect = 0;
|
dialect = 0;
|
break;
|
break;
|
#endif
|
#endif
|
|
|
case '%':
|
case '%':
|
/* %% outputs a single %. */
|
/* %% outputs a single %. */
|
if (*p == '%')
|
if (*p == '%')
|
{
|
{
|
p++;
|
p++;
|
putc (c, asm_out_file);
|
putc (c, asm_out_file);
|
}
|
}
|
/* %= outputs a number which is unique to each insn in the entire
|
/* %= outputs a number which is unique to each insn in the entire
|
compilation. This is useful for making local labels that are
|
compilation. This is useful for making local labels that are
|
referred to more than once in a given insn. */
|
referred to more than once in a given insn. */
|
else if (*p == '=')
|
else if (*p == '=')
|
{
|
{
|
p++;
|
p++;
|
fprintf (asm_out_file, "%d", insn_counter);
|
fprintf (asm_out_file, "%d", insn_counter);
|
}
|
}
|
/* % followed by a letter and some digits
|
/* % followed by a letter and some digits
|
outputs an operand in a special way depending on the letter.
|
outputs an operand in a special way depending on the letter.
|
Letters `acln' are implemented directly.
|
Letters `acln' are implemented directly.
|
Other letters are passed to `output_operand' so that
|
Other letters are passed to `output_operand' so that
|
the PRINT_OPERAND macro can define them. */
|
the PRINT_OPERAND macro can define them. */
|
else if (ISALPHA (*p))
|
else if (ISALPHA (*p))
|
{
|
{
|
int letter = *p++;
|
int letter = *p++;
|
unsigned long opnum;
|
unsigned long opnum;
|
char *endptr;
|
char *endptr;
|
|
|
opnum = strtoul (p, &endptr, 10);
|
opnum = strtoul (p, &endptr, 10);
|
|
|
if (endptr == p)
|
if (endptr == p)
|
output_operand_lossage ("operand number missing "
|
output_operand_lossage ("operand number missing "
|
"after %%-letter");
|
"after %%-letter");
|
else if (this_is_asm_operands && opnum >= insn_noperands)
|
else if (this_is_asm_operands && opnum >= insn_noperands)
|
output_operand_lossage ("operand number out of range");
|
output_operand_lossage ("operand number out of range");
|
else if (letter == 'l')
|
else if (letter == 'l')
|
output_asm_label (operands[opnum]);
|
output_asm_label (operands[opnum]);
|
else if (letter == 'a')
|
else if (letter == 'a')
|
output_address (operands[opnum]);
|
output_address (operands[opnum]);
|
else if (letter == 'c')
|
else if (letter == 'c')
|
{
|
{
|
if (CONSTANT_ADDRESS_P (operands[opnum]))
|
if (CONSTANT_ADDRESS_P (operands[opnum]))
|
output_addr_const (asm_out_file, operands[opnum]);
|
output_addr_const (asm_out_file, operands[opnum]);
|
else
|
else
|
output_operand (operands[opnum], 'c');
|
output_operand (operands[opnum], 'c');
|
}
|
}
|
else if (letter == 'n')
|
else if (letter == 'n')
|
{
|
{
|
if (GET_CODE (operands[opnum]) == CONST_INT)
|
if (GET_CODE (operands[opnum]) == CONST_INT)
|
fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
|
fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
|
- INTVAL (operands[opnum]));
|
- INTVAL (operands[opnum]));
|
else
|
else
|
{
|
{
|
putc ('-', asm_out_file);
|
putc ('-', asm_out_file);
|
output_addr_const (asm_out_file, operands[opnum]);
|
output_addr_const (asm_out_file, operands[opnum]);
|
}
|
}
|
}
|
}
|
else
|
else
|
output_operand (operands[opnum], letter);
|
output_operand (operands[opnum], letter);
|
|
|
if (!opoutput[opnum])
|
if (!opoutput[opnum])
|
oporder[ops++] = opnum;
|
oporder[ops++] = opnum;
|
opoutput[opnum] = 1;
|
opoutput[opnum] = 1;
|
|
|
p = endptr;
|
p = endptr;
|
c = *p;
|
c = *p;
|
}
|
}
|
/* % followed by a digit outputs an operand the default way. */
|
/* % followed by a digit outputs an operand the default way. */
|
else if (ISDIGIT (*p))
|
else if (ISDIGIT (*p))
|
{
|
{
|
unsigned long opnum;
|
unsigned long opnum;
|
char *endptr;
|
char *endptr;
|
|
|
opnum = strtoul (p, &endptr, 10);
|
opnum = strtoul (p, &endptr, 10);
|
if (this_is_asm_operands && opnum >= insn_noperands)
|
if (this_is_asm_operands && opnum >= insn_noperands)
|
output_operand_lossage ("operand number out of range");
|
output_operand_lossage ("operand number out of range");
|
else
|
else
|
output_operand (operands[opnum], 0);
|
output_operand (operands[opnum], 0);
|
|
|
if (!opoutput[opnum])
|
if (!opoutput[opnum])
|
oporder[ops++] = opnum;
|
oporder[ops++] = opnum;
|
opoutput[opnum] = 1;
|
opoutput[opnum] = 1;
|
|
|
p = endptr;
|
p = endptr;
|
c = *p;
|
c = *p;
|
}
|
}
|
/* % followed by punctuation: output something for that
|
/* % followed by punctuation: output something for that
|
punctuation character alone, with no operand.
|
punctuation character alone, with no operand.
|
The PRINT_OPERAND macro decides what is actually done. */
|
The PRINT_OPERAND macro decides what is actually done. */
|
#ifdef PRINT_OPERAND_PUNCT_VALID_P
|
#ifdef PRINT_OPERAND_PUNCT_VALID_P
|
else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char) *p))
|
else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char) *p))
|
output_operand (NULL_RTX, *p++);
|
output_operand (NULL_RTX, *p++);
|
#endif
|
#endif
|
else
|
else
|
output_operand_lossage ("invalid %%-code");
|
output_operand_lossage ("invalid %%-code");
|
break;
|
break;
|
|
|
default:
|
default:
|
putc (c, asm_out_file);
|
putc (c, asm_out_file);
|
}
|
}
|
|
|
/* Write out the variable names for operands, if we know them. */
|
/* Write out the variable names for operands, if we know them. */
|
if (flag_verbose_asm)
|
if (flag_verbose_asm)
|
output_asm_operand_names (operands, oporder, ops);
|
output_asm_operand_names (operands, oporder, ops);
|
if (flag_print_asm_name)
|
if (flag_print_asm_name)
|
output_asm_name ();
|
output_asm_name ();
|
|
|
putc ('\n', asm_out_file);
|
putc ('\n', asm_out_file);
|
}
|
}
|
|
|
/* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
|
/* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
|
|
|
void
|
void
|
output_asm_label (rtx x)
|
output_asm_label (rtx x)
|
{
|
{
|
char buf[256];
|
char buf[256];
|
|
|
if (GET_CODE (x) == LABEL_REF)
|
if (GET_CODE (x) == LABEL_REF)
|
x = XEXP (x, 0);
|
x = XEXP (x, 0);
|
if (LABEL_P (x)
|
if (LABEL_P (x)
|
|| (NOTE_P (x)
|
|| (NOTE_P (x)
|
&& NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
|
&& NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
|
ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
|
ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
|
else
|
else
|
output_operand_lossage ("'%%l' operand isn't a label");
|
output_operand_lossage ("'%%l' operand isn't a label");
|
|
|
assemble_name (asm_out_file, buf);
|
assemble_name (asm_out_file, buf);
|
}
|
}
|
|
|
/* Print operand X using machine-dependent assembler syntax.
|
/* Print operand X using machine-dependent assembler syntax.
|
The macro PRINT_OPERAND is defined just to control this function.
|
The macro PRINT_OPERAND is defined just to control this function.
|
CODE is a non-digit that preceded the operand-number in the % spec,
|
CODE is a non-digit that preceded the operand-number in the % spec,
|
such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
|
such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
|
between the % and the digits.
|
between the % and the digits.
|
When CODE is a non-letter, X is 0.
|
When CODE is a non-letter, X is 0.
|
|
|
The meanings of the letters are machine-dependent and controlled
|
The meanings of the letters are machine-dependent and controlled
|
by PRINT_OPERAND. */
|
by PRINT_OPERAND. */
|
|
|
static void
|
static void
|
output_operand (rtx x, int code ATTRIBUTE_UNUSED)
|
output_operand (rtx x, int code ATTRIBUTE_UNUSED)
|
{
|
{
|
if (x && GET_CODE (x) == SUBREG)
|
if (x && GET_CODE (x) == SUBREG)
|
x = alter_subreg (&x);
|
x = alter_subreg (&x);
|
|
|
/* X must not be a pseudo reg. */
|
/* X must not be a pseudo reg. */
|
gcc_assert (!x || !REG_P (x) || REGNO (x) < FIRST_PSEUDO_REGISTER);
|
gcc_assert (!x || !REG_P (x) || REGNO (x) < FIRST_PSEUDO_REGISTER);
|
|
|
PRINT_OPERAND (asm_out_file, x, code);
|
PRINT_OPERAND (asm_out_file, x, code);
|
}
|
}
|
|
|
/* Print a memory reference operand for address X
|
/* Print a memory reference operand for address X
|
using machine-dependent assembler syntax.
|
using machine-dependent assembler syntax.
|
The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
|
The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
|
|
|
void
|
void
|
output_address (rtx x)
|
output_address (rtx x)
|
{
|
{
|
walk_alter_subreg (&x);
|
walk_alter_subreg (&x);
|
PRINT_OPERAND_ADDRESS (asm_out_file, x);
|
PRINT_OPERAND_ADDRESS (asm_out_file, x);
|
}
|
}
|
|
|
/* Print an integer constant expression in assembler syntax.
|
/* Print an integer constant expression in assembler syntax.
|
Addition and subtraction are the only arithmetic
|
Addition and subtraction are the only arithmetic
|
that may appear in these expressions. */
|
that may appear in these expressions. */
|
|
|
void
|
void
|
output_addr_const (FILE *file, rtx x)
|
output_addr_const (FILE *file, rtx x)
|
{
|
{
|
char buf[256];
|
char buf[256];
|
|
|
restart:
|
restart:
|
switch (GET_CODE (x))
|
switch (GET_CODE (x))
|
{
|
{
|
case PC:
|
case PC:
|
putc ('.', file);
|
putc ('.', file);
|
break;
|
break;
|
|
|
case SYMBOL_REF:
|
case SYMBOL_REF:
|
if (SYMBOL_REF_DECL (x))
|
if (SYMBOL_REF_DECL (x))
|
mark_decl_referenced (SYMBOL_REF_DECL (x));
|
mark_decl_referenced (SYMBOL_REF_DECL (x));
|
#ifdef ASM_OUTPUT_SYMBOL_REF
|
#ifdef ASM_OUTPUT_SYMBOL_REF
|
ASM_OUTPUT_SYMBOL_REF (file, x);
|
ASM_OUTPUT_SYMBOL_REF (file, x);
|
#else
|
#else
|
assemble_name (file, XSTR (x, 0));
|
assemble_name (file, XSTR (x, 0));
|
#endif
|
#endif
|
break;
|
break;
|
|
|
case LABEL_REF:
|
case LABEL_REF:
|
x = XEXP (x, 0);
|
x = XEXP (x, 0);
|
/* Fall through. */
|
/* Fall through. */
|
case CODE_LABEL:
|
case CODE_LABEL:
|
ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
|
ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
|
#ifdef ASM_OUTPUT_LABEL_REF
|
#ifdef ASM_OUTPUT_LABEL_REF
|
ASM_OUTPUT_LABEL_REF (file, buf);
|
ASM_OUTPUT_LABEL_REF (file, buf);
|
#else
|
#else
|
assemble_name (file, buf);
|
assemble_name (file, buf);
|
#endif
|
#endif
|
break;
|
break;
|
|
|
case CONST_INT:
|
case CONST_INT:
|
fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
|
fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
|
break;
|
break;
|
|
|
case CONST:
|
case CONST:
|
/* This used to output parentheses around the expression,
|
/* This used to output parentheses around the expression,
|
but that does not work on the 386 (either ATT or BSD assembler). */
|
but that does not work on the 386 (either ATT or BSD assembler). */
|
output_addr_const (file, XEXP (x, 0));
|
output_addr_const (file, XEXP (x, 0));
|
break;
|
break;
|
|
|
case CONST_DOUBLE:
|
case CONST_DOUBLE:
|
if (GET_MODE (x) == VOIDmode)
|
if (GET_MODE (x) == VOIDmode)
|
{
|
{
|
/* We can use %d if the number is one word and positive. */
|
/* We can use %d if the number is one word and positive. */
|
if (CONST_DOUBLE_HIGH (x))
|
if (CONST_DOUBLE_HIGH (x))
|
fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
|
fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
|
CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
|
CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
|
else if (CONST_DOUBLE_LOW (x) < 0)
|
else if (CONST_DOUBLE_LOW (x) < 0)
|
fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
|
fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
|
else
|
else
|
fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
|
fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
|
}
|
}
|
else
|
else
|
/* We can't handle floating point constants;
|
/* We can't handle floating point constants;
|
PRINT_OPERAND must handle them. */
|
PRINT_OPERAND must handle them. */
|
output_operand_lossage ("floating constant misused");
|
output_operand_lossage ("floating constant misused");
|
break;
|
break;
|
|
|
case PLUS:
|
case PLUS:
|
/* Some assemblers need integer constants to appear last (eg masm). */
|
/* Some assemblers need integer constants to appear last (eg masm). */
|
if (GET_CODE (XEXP (x, 0)) == CONST_INT)
|
if (GET_CODE (XEXP (x, 0)) == CONST_INT)
|
{
|
{
|
output_addr_const (file, XEXP (x, 1));
|
output_addr_const (file, XEXP (x, 1));
|
if (INTVAL (XEXP (x, 0)) >= 0)
|
if (INTVAL (XEXP (x, 0)) >= 0)
|
fprintf (file, "+");
|
fprintf (file, "+");
|
output_addr_const (file, XEXP (x, 0));
|
output_addr_const (file, XEXP (x, 0));
|
}
|
}
|
else
|
else
|
{
|
{
|
output_addr_const (file, XEXP (x, 0));
|
output_addr_const (file, XEXP (x, 0));
|
if (GET_CODE (XEXP (x, 1)) != CONST_INT
|
if (GET_CODE (XEXP (x, 1)) != CONST_INT
|
|| INTVAL (XEXP (x, 1)) >= 0)
|
|| INTVAL (XEXP (x, 1)) >= 0)
|
fprintf (file, "+");
|
fprintf (file, "+");
|
output_addr_const (file, XEXP (x, 1));
|
output_addr_const (file, XEXP (x, 1));
|
}
|
}
|
break;
|
break;
|
|
|
case MINUS:
|
case MINUS:
|
/* Avoid outputting things like x-x or x+5-x,
|
/* Avoid outputting things like x-x or x+5-x,
|
since some assemblers can't handle that. */
|
since some assemblers can't handle that. */
|
x = simplify_subtraction (x);
|
x = simplify_subtraction (x);
|
if (GET_CODE (x) != MINUS)
|
if (GET_CODE (x) != MINUS)
|
goto restart;
|
goto restart;
|
|
|
output_addr_const (file, XEXP (x, 0));
|
output_addr_const (file, XEXP (x, 0));
|
fprintf (file, "-");
|
fprintf (file, "-");
|
if ((GET_CODE (XEXP (x, 1)) == CONST_INT && INTVAL (XEXP (x, 1)) >= 0)
|
if ((GET_CODE (XEXP (x, 1)) == CONST_INT && INTVAL (XEXP (x, 1)) >= 0)
|
|| GET_CODE (XEXP (x, 1)) == PC
|
|| GET_CODE (XEXP (x, 1)) == PC
|
|| GET_CODE (XEXP (x, 1)) == SYMBOL_REF)
|
|| GET_CODE (XEXP (x, 1)) == SYMBOL_REF)
|
output_addr_const (file, XEXP (x, 1));
|
output_addr_const (file, XEXP (x, 1));
|
else
|
else
|
{
|
{
|
fputs (targetm.asm_out.open_paren, file);
|
fputs (targetm.asm_out.open_paren, file);
|
output_addr_const (file, XEXP (x, 1));
|
output_addr_const (file, XEXP (x, 1));
|
fputs (targetm.asm_out.close_paren, file);
|
fputs (targetm.asm_out.close_paren, file);
|
}
|
}
|
break;
|
break;
|
|
|
case ZERO_EXTEND:
|
case ZERO_EXTEND:
|
case SIGN_EXTEND:
|
case SIGN_EXTEND:
|
case SUBREG:
|
case SUBREG:
|
output_addr_const (file, XEXP (x, 0));
|
output_addr_const (file, XEXP (x, 0));
|
break;
|
break;
|
|
|
default:
|
default:
|
#ifdef OUTPUT_ADDR_CONST_EXTRA
|
#ifdef OUTPUT_ADDR_CONST_EXTRA
|
OUTPUT_ADDR_CONST_EXTRA (file, x, fail);
|
OUTPUT_ADDR_CONST_EXTRA (file, x, fail);
|
break;
|
break;
|
|
|
fail:
|
fail:
|
#endif
|
#endif
|
output_operand_lossage ("invalid expression as operand");
|
output_operand_lossage ("invalid expression as operand");
|
}
|
}
|
}
|
}
|
|
|
/* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
|
/* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
|
%R prints the value of REGISTER_PREFIX.
|
%R prints the value of REGISTER_PREFIX.
|
%L prints the value of LOCAL_LABEL_PREFIX.
|
%L prints the value of LOCAL_LABEL_PREFIX.
|
%U prints the value of USER_LABEL_PREFIX.
|
%U prints the value of USER_LABEL_PREFIX.
|
%I prints the value of IMMEDIATE_PREFIX.
|
%I prints the value of IMMEDIATE_PREFIX.
|
%O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
|
%O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
|
Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
|
Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
|
|
|
We handle alternate assembler dialects here, just like output_asm_insn. */
|
We handle alternate assembler dialects here, just like output_asm_insn. */
|
|
|
void
|
void
|
asm_fprintf (FILE *file, const char *p, ...)
|
asm_fprintf (FILE *file, const char *p, ...)
|
{
|
{
|
char buf[10];
|
char buf[10];
|
char *q, c;
|
char *q, c;
|
va_list argptr;
|
va_list argptr;
|
|
|
va_start (argptr, p);
|
va_start (argptr, p);
|
|
|
buf[0] = '%';
|
buf[0] = '%';
|
|
|
while ((c = *p++))
|
while ((c = *p++))
|
switch (c)
|
switch (c)
|
{
|
{
|
#ifdef ASSEMBLER_DIALECT
|
#ifdef ASSEMBLER_DIALECT
|
case '{':
|
case '{':
|
{
|
{
|
int i;
|
int i;
|
|
|
/* If we want the first dialect, do nothing. Otherwise, skip
|
/* If we want the first dialect, do nothing. Otherwise, skip
|
DIALECT_NUMBER of strings ending with '|'. */
|
DIALECT_NUMBER of strings ending with '|'. */
|
for (i = 0; i < dialect_number; i++)
|
for (i = 0; i < dialect_number; i++)
|
{
|
{
|
while (*p && *p++ != '|')
|
while (*p && *p++ != '|')
|
;
|
;
|
|
|
if (*p == '|')
|
if (*p == '|')
|
p++;
|
p++;
|
}
|
}
|
}
|
}
|
break;
|
break;
|
|
|
case '|':
|
case '|':
|
/* Skip to close brace. */
|
/* Skip to close brace. */
|
while (*p && *p++ != '}')
|
while (*p && *p++ != '}')
|
;
|
;
|
break;
|
break;
|
|
|
case '}':
|
case '}':
|
break;
|
break;
|
#endif
|
#endif
|
|
|
case '%':
|
case '%':
|
c = *p++;
|
c = *p++;
|
q = &buf[1];
|
q = &buf[1];
|
while (strchr ("-+ #0", c))
|
while (strchr ("-+ #0", c))
|
{
|
{
|
*q++ = c;
|
*q++ = c;
|
c = *p++;
|
c = *p++;
|
}
|
}
|
while (ISDIGIT (c) || c == '.')
|
while (ISDIGIT (c) || c == '.')
|
{
|
{
|
*q++ = c;
|
*q++ = c;
|
c = *p++;
|
c = *p++;
|
}
|
}
|
switch (c)
|
switch (c)
|
{
|
{
|
case '%':
|
case '%':
|
putc ('%', file);
|
putc ('%', file);
|
break;
|
break;
|
|
|
case 'd': case 'i': case 'u':
|
case 'd': case 'i': case 'u':
|
case 'x': case 'X': case 'o':
|
case 'x': case 'X': case 'o':
|
case 'c':
|
case 'c':
|
*q++ = c;
|
*q++ = c;
|
*q = 0;
|
*q = 0;
|
fprintf (file, buf, va_arg (argptr, int));
|
fprintf (file, buf, va_arg (argptr, int));
|
break;
|
break;
|
|
|
case 'w':
|
case 'w':
|
/* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
|
/* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
|
'o' cases, but we do not check for those cases. It
|
'o' cases, but we do not check for those cases. It
|
means that the value is a HOST_WIDE_INT, which may be
|
means that the value is a HOST_WIDE_INT, which may be
|
either `long' or `long long'. */
|
either `long' or `long long'. */
|
memcpy (q, HOST_WIDE_INT_PRINT, strlen (HOST_WIDE_INT_PRINT));
|
memcpy (q, HOST_WIDE_INT_PRINT, strlen (HOST_WIDE_INT_PRINT));
|
q += strlen (HOST_WIDE_INT_PRINT);
|
q += strlen (HOST_WIDE_INT_PRINT);
|
*q++ = *p++;
|
*q++ = *p++;
|
*q = 0;
|
*q = 0;
|
fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
|
fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
|
break;
|
break;
|
|
|
case 'l':
|
case 'l':
|
*q++ = c;
|
*q++ = c;
|
#ifdef HAVE_LONG_LONG
|
#ifdef HAVE_LONG_LONG
|
if (*p == 'l')
|
if (*p == 'l')
|
{
|
{
|
*q++ = *p++;
|
*q++ = *p++;
|
*q++ = *p++;
|
*q++ = *p++;
|
*q = 0;
|
*q = 0;
|
fprintf (file, buf, va_arg (argptr, long long));
|
fprintf (file, buf, va_arg (argptr, long long));
|
}
|
}
|
else
|
else
|
#endif
|
#endif
|
{
|
{
|
*q++ = *p++;
|
*q++ = *p++;
|
*q = 0;
|
*q = 0;
|
fprintf (file, buf, va_arg (argptr, long));
|
fprintf (file, buf, va_arg (argptr, long));
|
}
|
}
|
|
|
break;
|
break;
|
|
|
case 's':
|
case 's':
|
*q++ = c;
|
*q++ = c;
|
*q = 0;
|
*q = 0;
|
fprintf (file, buf, va_arg (argptr, char *));
|
fprintf (file, buf, va_arg (argptr, char *));
|
break;
|
break;
|
|
|
case 'O':
|
case 'O':
|
#ifdef ASM_OUTPUT_OPCODE
|
#ifdef ASM_OUTPUT_OPCODE
|
ASM_OUTPUT_OPCODE (asm_out_file, p);
|
ASM_OUTPUT_OPCODE (asm_out_file, p);
|
#endif
|
#endif
|
break;
|
break;
|
|
|
case 'R':
|
case 'R':
|
#ifdef REGISTER_PREFIX
|
#ifdef REGISTER_PREFIX
|
fprintf (file, "%s", REGISTER_PREFIX);
|
fprintf (file, "%s", REGISTER_PREFIX);
|
#endif
|
#endif
|
break;
|
break;
|
|
|
case 'I':
|
case 'I':
|
#ifdef IMMEDIATE_PREFIX
|
#ifdef IMMEDIATE_PREFIX
|
fprintf (file, "%s", IMMEDIATE_PREFIX);
|
fprintf (file, "%s", IMMEDIATE_PREFIX);
|
#endif
|
#endif
|
break;
|
break;
|
|
|
case 'L':
|
case 'L':
|
#ifdef LOCAL_LABEL_PREFIX
|
#ifdef LOCAL_LABEL_PREFIX
|
fprintf (file, "%s", LOCAL_LABEL_PREFIX);
|
fprintf (file, "%s", LOCAL_LABEL_PREFIX);
|
#endif
|
#endif
|
break;
|
break;
|
|
|
case 'U':
|
case 'U':
|
fputs (user_label_prefix, file);
|
fputs (user_label_prefix, file);
|
break;
|
break;
|
|
|
#ifdef ASM_FPRINTF_EXTENSIONS
|
#ifdef ASM_FPRINTF_EXTENSIONS
|
/* Uppercase letters are reserved for general use by asm_fprintf
|
/* Uppercase letters are reserved for general use by asm_fprintf
|
and so are not available to target specific code. In order to
|
and so are not available to target specific code. In order to
|
prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
|
prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
|
they are defined here. As they get turned into real extensions
|
they are defined here. As they get turned into real extensions
|
to asm_fprintf they should be removed from this list. */
|
to asm_fprintf they should be removed from this list. */
|
case 'A': case 'B': case 'C': case 'D': case 'E':
|
case 'A': case 'B': case 'C': case 'D': case 'E':
|
case 'F': case 'G': case 'H': case 'J': case 'K':
|
case 'F': case 'G': case 'H': case 'J': case 'K':
|
case 'M': case 'N': case 'P': case 'Q': case 'S':
|
case 'M': case 'N': case 'P': case 'Q': case 'S':
|
case 'T': case 'V': case 'W': case 'Y': case 'Z':
|
case 'T': case 'V': case 'W': case 'Y': case 'Z':
|
break;
|
break;
|
|
|
ASM_FPRINTF_EXTENSIONS (file, argptr, p)
|
ASM_FPRINTF_EXTENSIONS (file, argptr, p)
|
#endif
|
#endif
|
default:
|
default:
|
gcc_unreachable ();
|
gcc_unreachable ();
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
putc (c, file);
|
putc (c, file);
|
}
|
}
|
va_end (argptr);
|
va_end (argptr);
|
}
|
}
|
|
|
/* Split up a CONST_DOUBLE or integer constant rtx
|
/* Split up a CONST_DOUBLE or integer constant rtx
|
into two rtx's for single words,
|
into two rtx's for single words,
|
storing in *FIRST the word that comes first in memory in the target
|
storing in *FIRST the word that comes first in memory in the target
|
and in *SECOND the other. */
|
and in *SECOND the other. */
|
|
|
void
|
void
|
split_double (rtx value, rtx *first, rtx *second)
|
split_double (rtx value, rtx *first, rtx *second)
|
{
|
{
|
if (GET_CODE (value) == CONST_INT)
|
if (GET_CODE (value) == CONST_INT)
|
{
|
{
|
if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
|
if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
|
{
|
{
|
/* In this case the CONST_INT holds both target words.
|
/* In this case the CONST_INT holds both target words.
|
Extract the bits from it into two word-sized pieces.
|
Extract the bits from it into two word-sized pieces.
|
Sign extend each half to HOST_WIDE_INT. */
|
Sign extend each half to HOST_WIDE_INT. */
|
unsigned HOST_WIDE_INT low, high;
|
unsigned HOST_WIDE_INT low, high;
|
unsigned HOST_WIDE_INT mask, sign_bit, sign_extend;
|
unsigned HOST_WIDE_INT mask, sign_bit, sign_extend;
|
|
|
/* Set sign_bit to the most significant bit of a word. */
|
/* Set sign_bit to the most significant bit of a word. */
|
sign_bit = 1;
|
sign_bit = 1;
|
sign_bit <<= BITS_PER_WORD - 1;
|
sign_bit <<= BITS_PER_WORD - 1;
|
|
|
/* Set mask so that all bits of the word are set. We could
|
/* Set mask so that all bits of the word are set. We could
|
have used 1 << BITS_PER_WORD instead of basing the
|
have used 1 << BITS_PER_WORD instead of basing the
|
calculation on sign_bit. However, on machines where
|
calculation on sign_bit. However, on machines where
|
HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
|
HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
|
compiler warning, even though the code would never be
|
compiler warning, even though the code would never be
|
executed. */
|
executed. */
|
mask = sign_bit << 1;
|
mask = sign_bit << 1;
|
mask--;
|
mask--;
|
|
|
/* Set sign_extend as any remaining bits. */
|
/* Set sign_extend as any remaining bits. */
|
sign_extend = ~mask;
|
sign_extend = ~mask;
|
|
|
/* Pick the lower word and sign-extend it. */
|
/* Pick the lower word and sign-extend it. */
|
low = INTVAL (value);
|
low = INTVAL (value);
|
low &= mask;
|
low &= mask;
|
if (low & sign_bit)
|
if (low & sign_bit)
|
low |= sign_extend;
|
low |= sign_extend;
|
|
|
/* Pick the higher word, shifted to the least significant
|
/* Pick the higher word, shifted to the least significant
|
bits, and sign-extend it. */
|
bits, and sign-extend it. */
|
high = INTVAL (value);
|
high = INTVAL (value);
|
high >>= BITS_PER_WORD - 1;
|
high >>= BITS_PER_WORD - 1;
|
high >>= 1;
|
high >>= 1;
|
high &= mask;
|
high &= mask;
|
if (high & sign_bit)
|
if (high & sign_bit)
|
high |= sign_extend;
|
high |= sign_extend;
|
|
|
/* Store the words in the target machine order. */
|
/* Store the words in the target machine order. */
|
if (WORDS_BIG_ENDIAN)
|
if (WORDS_BIG_ENDIAN)
|
{
|
{
|
*first = GEN_INT (high);
|
*first = GEN_INT (high);
|
*second = GEN_INT (low);
|
*second = GEN_INT (low);
|
}
|
}
|
else
|
else
|
{
|
{
|
*first = GEN_INT (low);
|
*first = GEN_INT (low);
|
*second = GEN_INT (high);
|
*second = GEN_INT (high);
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
/* The rule for using CONST_INT for a wider mode
|
/* The rule for using CONST_INT for a wider mode
|
is that we regard the value as signed.
|
is that we regard the value as signed.
|
So sign-extend it. */
|
So sign-extend it. */
|
rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
|
rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
|
if (WORDS_BIG_ENDIAN)
|
if (WORDS_BIG_ENDIAN)
|
{
|
{
|
*first = high;
|
*first = high;
|
*second = value;
|
*second = value;
|
}
|
}
|
else
|
else
|
{
|
{
|
*first = value;
|
*first = value;
|
*second = high;
|
*second = high;
|
}
|
}
|
}
|
}
|
}
|
}
|
else if (GET_CODE (value) != CONST_DOUBLE)
|
else if (GET_CODE (value) != CONST_DOUBLE)
|
{
|
{
|
if (WORDS_BIG_ENDIAN)
|
if (WORDS_BIG_ENDIAN)
|
{
|
{
|
*first = const0_rtx;
|
*first = const0_rtx;
|
*second = value;
|
*second = value;
|
}
|
}
|
else
|
else
|
{
|
{
|
*first = value;
|
*first = value;
|
*second = const0_rtx;
|
*second = const0_rtx;
|
}
|
}
|
}
|
}
|
else if (GET_MODE (value) == VOIDmode
|
else if (GET_MODE (value) == VOIDmode
|
/* This is the old way we did CONST_DOUBLE integers. */
|
/* This is the old way we did CONST_DOUBLE integers. */
|
|| GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
|
|| GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
|
{
|
{
|
/* In an integer, the words are defined as most and least significant.
|
/* In an integer, the words are defined as most and least significant.
|
So order them by the target's convention. */
|
So order them by the target's convention. */
|
if (WORDS_BIG_ENDIAN)
|
if (WORDS_BIG_ENDIAN)
|
{
|
{
|
*first = GEN_INT (CONST_DOUBLE_HIGH (value));
|
*first = GEN_INT (CONST_DOUBLE_HIGH (value));
|
*second = GEN_INT (CONST_DOUBLE_LOW (value));
|
*second = GEN_INT (CONST_DOUBLE_LOW (value));
|
}
|
}
|
else
|
else
|
{
|
{
|
*first = GEN_INT (CONST_DOUBLE_LOW (value));
|
*first = GEN_INT (CONST_DOUBLE_LOW (value));
|
*second = GEN_INT (CONST_DOUBLE_HIGH (value));
|
*second = GEN_INT (CONST_DOUBLE_HIGH (value));
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
REAL_VALUE_TYPE r;
|
REAL_VALUE_TYPE r;
|
long l[2];
|
long l[2];
|
REAL_VALUE_FROM_CONST_DOUBLE (r, value);
|
REAL_VALUE_FROM_CONST_DOUBLE (r, value);
|
|
|
/* Note, this converts the REAL_VALUE_TYPE to the target's
|
/* Note, this converts the REAL_VALUE_TYPE to the target's
|
format, splits up the floating point double and outputs
|
format, splits up the floating point double and outputs
|
exactly 32 bits of it into each of l[0] and l[1] --
|
exactly 32 bits of it into each of l[0] and l[1] --
|
not necessarily BITS_PER_WORD bits. */
|
not necessarily BITS_PER_WORD bits. */
|
REAL_VALUE_TO_TARGET_DOUBLE (r, l);
|
REAL_VALUE_TO_TARGET_DOUBLE (r, l);
|
|
|
/* If 32 bits is an entire word for the target, but not for the host,
|
/* If 32 bits is an entire word for the target, but not for the host,
|
then sign-extend on the host so that the number will look the same
|
then sign-extend on the host so that the number will look the same
|
way on the host that it would on the target. See for instance
|
way on the host that it would on the target. See for instance
|
simplify_unary_operation. The #if is needed to avoid compiler
|
simplify_unary_operation. The #if is needed to avoid compiler
|
warnings. */
|
warnings. */
|
|
|
#if HOST_BITS_PER_LONG > 32
|
#if HOST_BITS_PER_LONG > 32
|
if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
|
if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
|
{
|
{
|
if (l[0] & ((long) 1 << 31))
|
if (l[0] & ((long) 1 << 31))
|
l[0] |= ((long) (-1) << 32);
|
l[0] |= ((long) (-1) << 32);
|
if (l[1] & ((long) 1 << 31))
|
if (l[1] & ((long) 1 << 31))
|
l[1] |= ((long) (-1) << 32);
|
l[1] |= ((long) (-1) << 32);
|
}
|
}
|
#endif
|
#endif
|
|
|
*first = GEN_INT (l[0]);
|
*first = GEN_INT (l[0]);
|
*second = GEN_INT (l[1]);
|
*second = GEN_INT (l[1]);
|
}
|
}
|
}
|
}
|
|
|
/* Return nonzero if this function has no function calls. */
|
/* Return nonzero if this function has no function calls. */
|
|
|
int
|
int
|
leaf_function_p (void)
|
leaf_function_p (void)
|
{
|
{
|
rtx insn;
|
rtx insn;
|
rtx link;
|
rtx link;
|
|
|
if (current_function_profile || profile_arc_flag)
|
if (current_function_profile || profile_arc_flag)
|
return 0;
|
return 0;
|
|
|
for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
|
for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
|
{
|
{
|
if (CALL_P (insn)
|
if (CALL_P (insn)
|
&& ! SIBLING_CALL_P (insn))
|
&& ! SIBLING_CALL_P (insn))
|
return 0;
|
return 0;
|
if (NONJUMP_INSN_P (insn)
|
if (NONJUMP_INSN_P (insn)
|
&& GET_CODE (PATTERN (insn)) == SEQUENCE
|
&& GET_CODE (PATTERN (insn)) == SEQUENCE
|
&& CALL_P (XVECEXP (PATTERN (insn), 0, 0))
|
&& CALL_P (XVECEXP (PATTERN (insn), 0, 0))
|
&& ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
|
&& ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
|
return 0;
|
return 0;
|
}
|
}
|
for (link = current_function_epilogue_delay_list;
|
for (link = current_function_epilogue_delay_list;
|
link;
|
link;
|
link = XEXP (link, 1))
|
link = XEXP (link, 1))
|
{
|
{
|
insn = XEXP (link, 0);
|
insn = XEXP (link, 0);
|
|
|
if (CALL_P (insn)
|
if (CALL_P (insn)
|
&& ! SIBLING_CALL_P (insn))
|
&& ! SIBLING_CALL_P (insn))
|
return 0;
|
return 0;
|
if (NONJUMP_INSN_P (insn)
|
if (NONJUMP_INSN_P (insn)
|
&& GET_CODE (PATTERN (insn)) == SEQUENCE
|
&& GET_CODE (PATTERN (insn)) == SEQUENCE
|
&& CALL_P (XVECEXP (PATTERN (insn), 0, 0))
|
&& CALL_P (XVECEXP (PATTERN (insn), 0, 0))
|
&& ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
|
&& ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
|
return 0;
|
return 0;
|
}
|
}
|
|
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Return 1 if branch is a forward branch.
|
/* Return 1 if branch is a forward branch.
|
Uses insn_shuid array, so it works only in the final pass. May be used by
|
Uses insn_shuid array, so it works only in the final pass. May be used by
|
output templates to customary add branch prediction hints.
|
output templates to customary add branch prediction hints.
|
*/
|
*/
|
int
|
int
|
final_forward_branch_p (rtx insn)
|
final_forward_branch_p (rtx insn)
|
{
|
{
|
int insn_id, label_id;
|
int insn_id, label_id;
|
|
|
gcc_assert (uid_shuid);
|
gcc_assert (uid_shuid);
|
insn_id = INSN_SHUID (insn);
|
insn_id = INSN_SHUID (insn);
|
label_id = INSN_SHUID (JUMP_LABEL (insn));
|
label_id = INSN_SHUID (JUMP_LABEL (insn));
|
/* We've hit some insns that does not have id information available. */
|
/* We've hit some insns that does not have id information available. */
|
gcc_assert (insn_id && label_id);
|
gcc_assert (insn_id && label_id);
|
return insn_id < label_id;
|
return insn_id < label_id;
|
}
|
}
|
|
|
/* On some machines, a function with no call insns
|
/* On some machines, a function with no call insns
|
can run faster if it doesn't create its own register window.
|
can run faster if it doesn't create its own register window.
|
When output, the leaf function should use only the "output"
|
When output, the leaf function should use only the "output"
|
registers. Ordinarily, the function would be compiled to use
|
registers. Ordinarily, the function would be compiled to use
|
the "input" registers to find its arguments; it is a candidate
|
the "input" registers to find its arguments; it is a candidate
|
for leaf treatment if it uses only the "input" registers.
|
for leaf treatment if it uses only the "input" registers.
|
Leaf function treatment means renumbering so the function
|
Leaf function treatment means renumbering so the function
|
uses the "output" registers instead. */
|
uses the "output" registers instead. */
|
|
|
#ifdef LEAF_REGISTERS
|
#ifdef LEAF_REGISTERS
|
|
|
/* Return 1 if this function uses only the registers that can be
|
/* Return 1 if this function uses only the registers that can be
|
safely renumbered. */
|
safely renumbered. */
|
|
|
int
|
int
|
only_leaf_regs_used (void)
|
only_leaf_regs_used (void)
|
{
|
{
|
int i;
|
int i;
|
const char *const permitted_reg_in_leaf_functions = LEAF_REGISTERS;
|
const char *const permitted_reg_in_leaf_functions = LEAF_REGISTERS;
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
if ((regs_ever_live[i] || global_regs[i])
|
if ((regs_ever_live[i] || global_regs[i])
|
&& ! permitted_reg_in_leaf_functions[i])
|
&& ! permitted_reg_in_leaf_functions[i])
|
return 0;
|
return 0;
|
|
|
if (current_function_uses_pic_offset_table
|
if (current_function_uses_pic_offset_table
|
&& pic_offset_table_rtx != 0
|
&& pic_offset_table_rtx != 0
|
&& REG_P (pic_offset_table_rtx)
|
&& REG_P (pic_offset_table_rtx)
|
&& ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
|
&& ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
|
return 0;
|
return 0;
|
|
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Scan all instructions and renumber all registers into those
|
/* Scan all instructions and renumber all registers into those
|
available in leaf functions. */
|
available in leaf functions. */
|
|
|
static void
|
static void
|
leaf_renumber_regs (rtx first)
|
leaf_renumber_regs (rtx first)
|
{
|
{
|
rtx insn;
|
rtx insn;
|
|
|
/* Renumber only the actual patterns.
|
/* Renumber only the actual patterns.
|
The reg-notes can contain frame pointer refs,
|
The reg-notes can contain frame pointer refs,
|
and renumbering them could crash, and should not be needed. */
|
and renumbering them could crash, and should not be needed. */
|
for (insn = first; insn; insn = NEXT_INSN (insn))
|
for (insn = first; insn; insn = NEXT_INSN (insn))
|
if (INSN_P (insn))
|
if (INSN_P (insn))
|
leaf_renumber_regs_insn (PATTERN (insn));
|
leaf_renumber_regs_insn (PATTERN (insn));
|
for (insn = current_function_epilogue_delay_list;
|
for (insn = current_function_epilogue_delay_list;
|
insn;
|
insn;
|
insn = XEXP (insn, 1))
|
insn = XEXP (insn, 1))
|
if (INSN_P (XEXP (insn, 0)))
|
if (INSN_P (XEXP (insn, 0)))
|
leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
|
leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
|
}
|
}
|
|
|
/* Scan IN_RTX and its subexpressions, and renumber all regs into those
|
/* Scan IN_RTX and its subexpressions, and renumber all regs into those
|
available in leaf functions. */
|
available in leaf functions. */
|
|
|
void
|
void
|
leaf_renumber_regs_insn (rtx in_rtx)
|
leaf_renumber_regs_insn (rtx in_rtx)
|
{
|
{
|
int i, j;
|
int i, j;
|
const char *format_ptr;
|
const char *format_ptr;
|
|
|
if (in_rtx == 0)
|
if (in_rtx == 0)
|
return;
|
return;
|
|
|
/* Renumber all input-registers into output-registers.
|
/* Renumber all input-registers into output-registers.
|
renumbered_regs would be 1 for an output-register;
|
renumbered_regs would be 1 for an output-register;
|
they */
|
they */
|
|
|
if (REG_P (in_rtx))
|
if (REG_P (in_rtx))
|
{
|
{
|
int newreg;
|
int newreg;
|
|
|
/* Don't renumber the same reg twice. */
|
/* Don't renumber the same reg twice. */
|
if (in_rtx->used)
|
if (in_rtx->used)
|
return;
|
return;
|
|
|
newreg = REGNO (in_rtx);
|
newreg = REGNO (in_rtx);
|
/* Don't try to renumber pseudo regs. It is possible for a pseudo reg
|
/* Don't try to renumber pseudo regs. It is possible for a pseudo reg
|
to reach here as part of a REG_NOTE. */
|
to reach here as part of a REG_NOTE. */
|
if (newreg >= FIRST_PSEUDO_REGISTER)
|
if (newreg >= FIRST_PSEUDO_REGISTER)
|
{
|
{
|
in_rtx->used = 1;
|
in_rtx->used = 1;
|
return;
|
return;
|
}
|
}
|
newreg = LEAF_REG_REMAP (newreg);
|
newreg = LEAF_REG_REMAP (newreg);
|
gcc_assert (newreg >= 0);
|
gcc_assert (newreg >= 0);
|
regs_ever_live[REGNO (in_rtx)] = 0;
|
regs_ever_live[REGNO (in_rtx)] = 0;
|
regs_ever_live[newreg] = 1;
|
regs_ever_live[newreg] = 1;
|
REGNO (in_rtx) = newreg;
|
REGNO (in_rtx) = newreg;
|
in_rtx->used = 1;
|
in_rtx->used = 1;
|
}
|
}
|
|
|
if (INSN_P (in_rtx))
|
if (INSN_P (in_rtx))
|
{
|
{
|
/* Inside a SEQUENCE, we find insns.
|
/* Inside a SEQUENCE, we find insns.
|
Renumber just the patterns of these insns,
|
Renumber just the patterns of these insns,
|
just as we do for the top-level insns. */
|
just as we do for the top-level insns. */
|
leaf_renumber_regs_insn (PATTERN (in_rtx));
|
leaf_renumber_regs_insn (PATTERN (in_rtx));
|
return;
|
return;
|
}
|
}
|
|
|
format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
|
format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
|
|
|
for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
|
for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
|
switch (*format_ptr++)
|
switch (*format_ptr++)
|
{
|
{
|
case 'e':
|
case 'e':
|
leaf_renumber_regs_insn (XEXP (in_rtx, i));
|
leaf_renumber_regs_insn (XEXP (in_rtx, i));
|
break;
|
break;
|
|
|
case 'E':
|
case 'E':
|
if (NULL != XVEC (in_rtx, i))
|
if (NULL != XVEC (in_rtx, i))
|
{
|
{
|
for (j = 0; j < XVECLEN (in_rtx, i); j++)
|
for (j = 0; j < XVECLEN (in_rtx, i); j++)
|
leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));
|
leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));
|
}
|
}
|
break;
|
break;
|
|
|
case 'S':
|
case 'S':
|
case 's':
|
case 's':
|
case '0':
|
case '0':
|
case 'i':
|
case 'i':
|
case 'w':
|
case 'w':
|
case 'n':
|
case 'n':
|
case 'u':
|
case 'u':
|
break;
|
break;
|
|
|
default:
|
default:
|
gcc_unreachable ();
|
gcc_unreachable ();
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
/* When -gused is used, emit debug info for only used symbols. But in
|
/* When -gused is used, emit debug info for only used symbols. But in
|
addition to the standard intercepted debug_hooks there are some direct
|
addition to the standard intercepted debug_hooks there are some direct
|
calls into this file, i.e., dbxout_symbol, dbxout_parms, and dbxout_reg_params.
|
calls into this file, i.e., dbxout_symbol, dbxout_parms, and dbxout_reg_params.
|
Those routines may also be called from a higher level intercepted routine. So
|
Those routines may also be called from a higher level intercepted routine. So
|
to prevent recording data for an inner call to one of these for an intercept,
|
to prevent recording data for an inner call to one of these for an intercept,
|
we maintain an intercept nesting counter (debug_nesting). We only save the
|
we maintain an intercept nesting counter (debug_nesting). We only save the
|
intercepted arguments if the nesting is 1. */
|
intercepted arguments if the nesting is 1. */
|
int debug_nesting = 0;
|
int debug_nesting = 0;
|
|
|
static tree *symbol_queue;
|
static tree *symbol_queue;
|
int symbol_queue_index = 0;
|
int symbol_queue_index = 0;
|
static int symbol_queue_size = 0;
|
static int symbol_queue_size = 0;
|
|
|
/* Generate the symbols for any queued up type symbols we encountered
|
/* Generate the symbols for any queued up type symbols we encountered
|
while generating the type info for some originally used symbol.
|
while generating the type info for some originally used symbol.
|
This might generate additional entries in the queue. Only when
|
This might generate additional entries in the queue. Only when
|
the nesting depth goes to 0 is this routine called. */
|
the nesting depth goes to 0 is this routine called. */
|
|
|
void
|
void
|
debug_flush_symbol_queue (void)
|
debug_flush_symbol_queue (void)
|
{
|
{
|
int i;
|
int i;
|
|
|
/* Make sure that additionally queued items are not flushed
|
/* Make sure that additionally queued items are not flushed
|
prematurely. */
|
prematurely. */
|
|
|
++debug_nesting;
|
++debug_nesting;
|
|
|
for (i = 0; i < symbol_queue_index; ++i)
|
for (i = 0; i < symbol_queue_index; ++i)
|
{
|
{
|
/* If we pushed queued symbols then such symbols must be
|
/* If we pushed queued symbols then such symbols must be
|
output no matter what anyone else says. Specifically,
|
output no matter what anyone else says. Specifically,
|
we need to make sure dbxout_symbol() thinks the symbol was
|
we need to make sure dbxout_symbol() thinks the symbol was
|
used and also we need to override TYPE_DECL_SUPPRESS_DEBUG
|
used and also we need to override TYPE_DECL_SUPPRESS_DEBUG
|
which may be set for outside reasons. */
|
which may be set for outside reasons. */
|
int saved_tree_used = TREE_USED (symbol_queue[i]);
|
int saved_tree_used = TREE_USED (symbol_queue[i]);
|
int saved_suppress_debug = TYPE_DECL_SUPPRESS_DEBUG (symbol_queue[i]);
|
int saved_suppress_debug = TYPE_DECL_SUPPRESS_DEBUG (symbol_queue[i]);
|
TREE_USED (symbol_queue[i]) = 1;
|
TREE_USED (symbol_queue[i]) = 1;
|
TYPE_DECL_SUPPRESS_DEBUG (symbol_queue[i]) = 0;
|
TYPE_DECL_SUPPRESS_DEBUG (symbol_queue[i]) = 0;
|
|
|
#ifdef DBX_DEBUGGING_INFO
|
#ifdef DBX_DEBUGGING_INFO
|
dbxout_symbol (symbol_queue[i], 0);
|
dbxout_symbol (symbol_queue[i], 0);
|
#endif
|
#endif
|
|
|
TREE_USED (symbol_queue[i]) = saved_tree_used;
|
TREE_USED (symbol_queue[i]) = saved_tree_used;
|
TYPE_DECL_SUPPRESS_DEBUG (symbol_queue[i]) = saved_suppress_debug;
|
TYPE_DECL_SUPPRESS_DEBUG (symbol_queue[i]) = saved_suppress_debug;
|
}
|
}
|
|
|
symbol_queue_index = 0;
|
symbol_queue_index = 0;
|
--debug_nesting;
|
--debug_nesting;
|
}
|
}
|
|
|
/* Queue a type symbol needed as part of the definition of a decl
|
/* Queue a type symbol needed as part of the definition of a decl
|
symbol. These symbols are generated when debug_flush_symbol_queue()
|
symbol. These symbols are generated when debug_flush_symbol_queue()
|
is called. */
|
is called. */
|
|
|
void
|
void
|
debug_queue_symbol (tree decl)
|
debug_queue_symbol (tree decl)
|
{
|
{
|
if (symbol_queue_index >= symbol_queue_size)
|
if (symbol_queue_index >= symbol_queue_size)
|
{
|
{
|
symbol_queue_size += 10;
|
symbol_queue_size += 10;
|
symbol_queue = xrealloc (symbol_queue,
|
symbol_queue = xrealloc (symbol_queue,
|
symbol_queue_size * sizeof (tree));
|
symbol_queue_size * sizeof (tree));
|
}
|
}
|
|
|
symbol_queue[symbol_queue_index++] = decl;
|
symbol_queue[symbol_queue_index++] = decl;
|
}
|
}
|
|
|
/* Free symbol queue. */
|
/* Free symbol queue. */
|
void
|
void
|
debug_free_queue (void)
|
debug_free_queue (void)
|
{
|
{
|
if (symbol_queue)
|
if (symbol_queue)
|
{
|
{
|
free (symbol_queue);
|
free (symbol_queue);
|
symbol_queue = NULL;
|
symbol_queue = NULL;
|
symbol_queue_size = 0;
|
symbol_queue_size = 0;
|
}
|
}
|
}
|
}
|
|
|
/* Turn the RTL into assembly. */
|
/* Turn the RTL into assembly. */
|
static unsigned int
|
static unsigned int
|
rest_of_handle_final (void)
|
rest_of_handle_final (void)
|
{
|
{
|
rtx x;
|
rtx x;
|
const char *fnname;
|
const char *fnname;
|
|
|
/* Get the function's name, as described by its RTL. This may be
|
/* Get the function's name, as described by its RTL. This may be
|
different from the DECL_NAME name used in the source file. */
|
different from the DECL_NAME name used in the source file. */
|
|
|
x = DECL_RTL (current_function_decl);
|
x = DECL_RTL (current_function_decl);
|
gcc_assert (MEM_P (x));
|
gcc_assert (MEM_P (x));
|
x = XEXP (x, 0);
|
x = XEXP (x, 0);
|
gcc_assert (GET_CODE (x) == SYMBOL_REF);
|
gcc_assert (GET_CODE (x) == SYMBOL_REF);
|
fnname = XSTR (x, 0);
|
fnname = XSTR (x, 0);
|
|
|
assemble_start_function (current_function_decl, fnname);
|
assemble_start_function (current_function_decl, fnname);
|
final_start_function (get_insns (), asm_out_file, optimize);
|
final_start_function (get_insns (), asm_out_file, optimize);
|
final (get_insns (), asm_out_file, optimize);
|
final (get_insns (), asm_out_file, optimize);
|
final_end_function ();
|
final_end_function ();
|
|
|
#ifdef TARGET_UNWIND_INFO
|
#ifdef TARGET_UNWIND_INFO
|
/* ??? The IA-64 ".handlerdata" directive must be issued before
|
/* ??? The IA-64 ".handlerdata" directive must be issued before
|
the ".endp" directive that closes the procedure descriptor. */
|
the ".endp" directive that closes the procedure descriptor. */
|
output_function_exception_table ();
|
output_function_exception_table ();
|
#endif
|
#endif
|
|
|
assemble_end_function (current_function_decl, fnname);
|
assemble_end_function (current_function_decl, fnname);
|
|
|
#ifndef TARGET_UNWIND_INFO
|
#ifndef TARGET_UNWIND_INFO
|
/* Otherwise, it feels unclean to switch sections in the middle. */
|
/* Otherwise, it feels unclean to switch sections in the middle. */
|
output_function_exception_table ();
|
output_function_exception_table ();
|
#endif
|
#endif
|
|
|
user_defined_section_attribute = false;
|
user_defined_section_attribute = false;
|
|
|
if (! quiet_flag)
|
if (! quiet_flag)
|
fflush (asm_out_file);
|
fflush (asm_out_file);
|
|
|
/* Release all memory allocated by flow. */
|
/* Release all memory allocated by flow. */
|
free_basic_block_vars ();
|
free_basic_block_vars ();
|
|
|
/* Write DBX symbols if requested. */
|
/* Write DBX symbols if requested. */
|
|
|
/* Note that for those inline functions where we don't initially
|
/* Note that for those inline functions where we don't initially
|
know for certain that we will be generating an out-of-line copy,
|
know for certain that we will be generating an out-of-line copy,
|
the first invocation of this routine (rest_of_compilation) will
|
the first invocation of this routine (rest_of_compilation) will
|
skip over this code by doing a `goto exit_rest_of_compilation;'.
|
skip over this code by doing a `goto exit_rest_of_compilation;'.
|
Later on, wrapup_global_declarations will (indirectly) call
|
Later on, wrapup_global_declarations will (indirectly) call
|
rest_of_compilation again for those inline functions that need
|
rest_of_compilation again for those inline functions that need
|
to have out-of-line copies generated. During that call, we
|
to have out-of-line copies generated. During that call, we
|
*will* be routed past here. */
|
*will* be routed past here. */
|
|
|
timevar_push (TV_SYMOUT);
|
timevar_push (TV_SYMOUT);
|
(*debug_hooks->function_decl) (current_function_decl);
|
(*debug_hooks->function_decl) (current_function_decl);
|
timevar_pop (TV_SYMOUT);
|
timevar_pop (TV_SYMOUT);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct tree_opt_pass pass_final =
|
struct tree_opt_pass pass_final =
|
{
|
{
|
NULL, /* name */
|
NULL, /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
rest_of_handle_final, /* execute */
|
rest_of_handle_final, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_FINAL, /* tv_id */
|
TV_FINAL, /* tv_id */
|
0, /* properties_required */
|
0, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
TODO_ggc_collect, /* todo_flags_finish */
|
TODO_ggc_collect, /* todo_flags_finish */
|
0 /* letter */
|
0 /* letter */
|
};
|
};
|
|
|
|
|
static unsigned int
|
static unsigned int
|
rest_of_handle_shorten_branches (void)
|
rest_of_handle_shorten_branches (void)
|
{
|
{
|
/* Shorten branches. */
|
/* Shorten branches. */
|
shorten_branches (get_insns ());
|
shorten_branches (get_insns ());
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct tree_opt_pass pass_shorten_branches =
|
struct tree_opt_pass pass_shorten_branches =
|
{
|
{
|
"shorten", /* name */
|
"shorten", /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
rest_of_handle_shorten_branches, /* execute */
|
rest_of_handle_shorten_branches, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_FINAL, /* tv_id */
|
TV_FINAL, /* tv_id */
|
0, /* properties_required */
|
0, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
TODO_dump_func, /* todo_flags_finish */
|
TODO_dump_func, /* todo_flags_finish */
|
0 /* letter */
|
0 /* letter */
|
};
|
};
|
|
|
|
|
static unsigned int
|
static unsigned int
|
rest_of_clean_state (void)
|
rest_of_clean_state (void)
|
{
|
{
|
rtx insn, next;
|
rtx insn, next;
|
|
|
/* It is very important to decompose the RTL instruction chain here:
|
/* It is very important to decompose the RTL instruction chain here:
|
debug information keeps pointing into CODE_LABEL insns inside the function
|
debug information keeps pointing into CODE_LABEL insns inside the function
|
body. If these remain pointing to the other insns, we end up preserving
|
body. If these remain pointing to the other insns, we end up preserving
|
whole RTL chain and attached detailed debug info in memory. */
|
whole RTL chain and attached detailed debug info in memory. */
|
for (insn = get_insns (); insn; insn = next)
|
for (insn = get_insns (); insn; insn = next)
|
{
|
{
|
next = NEXT_INSN (insn);
|
next = NEXT_INSN (insn);
|
NEXT_INSN (insn) = NULL;
|
NEXT_INSN (insn) = NULL;
|
PREV_INSN (insn) = NULL;
|
PREV_INSN (insn) = NULL;
|
}
|
}
|
|
|
/* In case the function was not output,
|
/* In case the function was not output,
|
don't leave any temporary anonymous types
|
don't leave any temporary anonymous types
|
queued up for sdb output. */
|
queued up for sdb output. */
|
#ifdef SDB_DEBUGGING_INFO
|
#ifdef SDB_DEBUGGING_INFO
|
if (write_symbols == SDB_DEBUG)
|
if (write_symbols == SDB_DEBUG)
|
sdbout_types (NULL_TREE);
|
sdbout_types (NULL_TREE);
|
#endif
|
#endif
|
|
|
reload_completed = 0;
|
reload_completed = 0;
|
epilogue_completed = 0;
|
epilogue_completed = 0;
|
flow2_completed = 0;
|
flow2_completed = 0;
|
no_new_pseudos = 0;
|
no_new_pseudos = 0;
|
#ifdef STACK_REGS
|
#ifdef STACK_REGS
|
regstack_completed = 0;
|
regstack_completed = 0;
|
#endif
|
#endif
|
|
|
/* Clear out the insn_length contents now that they are no
|
/* Clear out the insn_length contents now that they are no
|
longer valid. */
|
longer valid. */
|
init_insn_lengths ();
|
init_insn_lengths ();
|
|
|
/* Show no temporary slots allocated. */
|
/* Show no temporary slots allocated. */
|
init_temp_slots ();
|
init_temp_slots ();
|
|
|
free_basic_block_vars ();
|
free_basic_block_vars ();
|
free_bb_for_insn ();
|
free_bb_for_insn ();
|
|
|
|
|
if (targetm.binds_local_p (current_function_decl))
|
if (targetm.binds_local_p (current_function_decl))
|
{
|
{
|
int pref = cfun->preferred_stack_boundary;
|
int pref = cfun->preferred_stack_boundary;
|
if (cfun->stack_alignment_needed > cfun->preferred_stack_boundary)
|
if (cfun->stack_alignment_needed > cfun->preferred_stack_boundary)
|
pref = cfun->stack_alignment_needed;
|
pref = cfun->stack_alignment_needed;
|
cgraph_rtl_info (current_function_decl)->preferred_incoming_stack_boundary
|
cgraph_rtl_info (current_function_decl)->preferred_incoming_stack_boundary
|
= pref;
|
= pref;
|
}
|
}
|
|
|
/* Make sure volatile mem refs aren't considered valid operands for
|
/* Make sure volatile mem refs aren't considered valid operands for
|
arithmetic insns. We must call this here if this is a nested inline
|
arithmetic insns. We must call this here if this is a nested inline
|
function, since the above code leaves us in the init_recog state,
|
function, since the above code leaves us in the init_recog state,
|
and the function context push/pop code does not save/restore volatile_ok.
|
and the function context push/pop code does not save/restore volatile_ok.
|
|
|
??? Maybe it isn't necessary for expand_start_function to call this
|
??? Maybe it isn't necessary for expand_start_function to call this
|
anymore if we do it here? */
|
anymore if we do it here? */
|
|
|
init_recog_no_volatile ();
|
init_recog_no_volatile ();
|
|
|
/* We're done with this function. Free up memory if we can. */
|
/* We're done with this function. Free up memory if we can. */
|
free_after_parsing (cfun);
|
free_after_parsing (cfun);
|
free_after_compilation (cfun);
|
free_after_compilation (cfun);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct tree_opt_pass pass_clean_state =
|
struct tree_opt_pass pass_clean_state =
|
{
|
{
|
NULL, /* name */
|
NULL, /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
rest_of_clean_state, /* execute */
|
rest_of_clean_state, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_FINAL, /* tv_id */
|
TV_FINAL, /* tv_id */
|
0, /* properties_required */
|
0, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
PROP_rtl, /* properties_destroyed */
|
PROP_rtl, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
0, /* todo_flags_finish */
|
0, /* todo_flags_finish */
|
0 /* letter */
|
0 /* letter */
|
};
|
};
|
|
|
|
|
