409 lines
12 KiB
C
409 lines
12 KiB
C
/* Procedure integration for GCC.
|
||
Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
|
||
2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
|
||
Contributed by Michael Tiemann (tiemann@cygnus.com)
|
||
|
||
This file is part of GCC.
|
||
|
||
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
|
||
Software Foundation; either version 2, or (at your option) any later
|
||
version.
|
||
|
||
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
||
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||
for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with GCC; see the file COPYING. If not, write to the Free
|
||
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
||
02111-1307, USA. */
|
||
|
||
#include "config.h"
|
||
#include "system.h"
|
||
#include "coretypes.h"
|
||
#include "tm.h"
|
||
|
||
#include "rtl.h"
|
||
#include "tree.h"
|
||
#include "tm_p.h"
|
||
#include "regs.h"
|
||
#include "flags.h"
|
||
#include "debug.h"
|
||
#include "insn-config.h"
|
||
#include "expr.h"
|
||
#include "output.h"
|
||
#include "recog.h"
|
||
#include "integrate.h"
|
||
#include "real.h"
|
||
#include "except.h"
|
||
#include "function.h"
|
||
#include "toplev.h"
|
||
#include "intl.h"
|
||
#include "params.h"
|
||
#include "ggc.h"
|
||
#include "target.h"
|
||
#include "langhooks.h"
|
||
|
||
/* Round to the next highest integer that meets the alignment. */
|
||
#define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
|
||
|
||
|
||
/* Private type used by {get/has}_func_hard_reg_initial_val. */
|
||
typedef struct initial_value_pair GTY(()) {
|
||
rtx hard_reg;
|
||
rtx pseudo;
|
||
} initial_value_pair;
|
||
typedef struct initial_value_struct GTY(()) {
|
||
int num_entries;
|
||
int max_entries;
|
||
initial_value_pair * GTY ((length ("%h.num_entries"))) entries;
|
||
} initial_value_struct;
|
||
|
||
static void set_block_origin_self (tree);
|
||
static void set_block_abstract_flags (tree, int);
|
||
|
||
|
||
/* Return false if the function FNDECL cannot be inlined on account of its
|
||
attributes, true otherwise. */
|
||
bool
|
||
function_attribute_inlinable_p (tree fndecl)
|
||
{
|
||
if (targetm.attribute_table)
|
||
{
|
||
tree a;
|
||
|
||
for (a = DECL_ATTRIBUTES (fndecl); a; a = TREE_CHAIN (a))
|
||
{
|
||
tree name = TREE_PURPOSE (a);
|
||
int i;
|
||
|
||
for (i = 0; targetm.attribute_table[i].name != NULL; i++)
|
||
if (is_attribute_p (targetm.attribute_table[i].name, name))
|
||
return targetm.function_attribute_inlinable_p (fndecl);
|
||
}
|
||
}
|
||
|
||
return true;
|
||
}
|
||
|
||
/* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
|
||
but now it will be in the TO_FN. */
|
||
|
||
tree
|
||
copy_decl_for_inlining (tree decl, tree from_fn, tree to_fn)
|
||
{
|
||
tree copy;
|
||
|
||
/* Copy the declaration. */
|
||
if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
|
||
{
|
||
tree type = TREE_TYPE (decl);
|
||
|
||
/* For a parameter or result, we must make an equivalent VAR_DECL, not a
|
||
new PARM_DECL. */
|
||
copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
|
||
TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
|
||
TREE_READONLY (copy) = TREE_READONLY (decl);
|
||
TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
|
||
}
|
||
else
|
||
{
|
||
copy = copy_node (decl);
|
||
/* The COPY is not abstract; it will be generated in TO_FN. */
|
||
DECL_ABSTRACT (copy) = 0;
|
||
lang_hooks.dup_lang_specific_decl (copy);
|
||
|
||
/* TREE_ADDRESSABLE isn't used to indicate that a label's
|
||
address has been taken; it's for internal bookkeeping in
|
||
expand_goto_internal. */
|
||
if (TREE_CODE (copy) == LABEL_DECL)
|
||
{
|
||
TREE_ADDRESSABLE (copy) = 0;
|
||
}
|
||
}
|
||
|
||
/* Don't generate debug information for the copy if we wouldn't have
|
||
generated it for the copy either. */
|
||
DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
|
||
DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
|
||
|
||
/* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
|
||
declaration inspired this copy. */
|
||
DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
|
||
|
||
/* The new variable/label has no RTL, yet. */
|
||
if (!TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
|
||
SET_DECL_RTL (copy, NULL_RTX);
|
||
|
||
/* These args would always appear unused, if not for this. */
|
||
TREE_USED (copy) = 1;
|
||
|
||
/* Set the context for the new declaration. */
|
||
if (!DECL_CONTEXT (decl))
|
||
/* Globals stay global. */
|
||
;
|
||
else if (DECL_CONTEXT (decl) != from_fn)
|
||
/* Things that weren't in the scope of the function we're inlining
|
||
from aren't in the scope we're inlining to, either. */
|
||
;
|
||
else if (TREE_STATIC (decl))
|
||
/* Function-scoped static variables should stay in the original
|
||
function. */
|
||
;
|
||
else
|
||
/* Ordinary automatic local variables are now in the scope of the
|
||
new function. */
|
||
DECL_CONTEXT (copy) = to_fn;
|
||
|
||
return copy;
|
||
}
|
||
|
||
|
||
/* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
|
||
given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
|
||
that it points to the node itself, thus indicating that the node is its
|
||
own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
|
||
the given node is NULL, recursively descend the decl/block tree which
|
||
it is the root of, and for each other ..._DECL or BLOCK node contained
|
||
therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
|
||
still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
|
||
values to point to themselves. */
|
||
|
||
static void
|
||
set_block_origin_self (tree stmt)
|
||
{
|
||
if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
|
||
{
|
||
BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
|
||
|
||
{
|
||
tree local_decl;
|
||
|
||
for (local_decl = BLOCK_VARS (stmt);
|
||
local_decl != NULL_TREE;
|
||
local_decl = TREE_CHAIN (local_decl))
|
||
set_decl_origin_self (local_decl); /* Potential recursion. */
|
||
}
|
||
|
||
{
|
||
tree subblock;
|
||
|
||
for (subblock = BLOCK_SUBBLOCKS (stmt);
|
||
subblock != NULL_TREE;
|
||
subblock = BLOCK_CHAIN (subblock))
|
||
set_block_origin_self (subblock); /* Recurse. */
|
||
}
|
||
}
|
||
}
|
||
|
||
/* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
|
||
the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
|
||
node to so that it points to the node itself, thus indicating that the
|
||
node represents its own (abstract) origin. Additionally, if the
|
||
DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
|
||
the decl/block tree of which the given node is the root of, and for
|
||
each other ..._DECL or BLOCK node contained therein whose
|
||
DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
|
||
set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
|
||
point to themselves. */
|
||
|
||
void
|
||
set_decl_origin_self (tree decl)
|
||
{
|
||
if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
|
||
{
|
||
DECL_ABSTRACT_ORIGIN (decl) = decl;
|
||
if (TREE_CODE (decl) == FUNCTION_DECL)
|
||
{
|
||
tree arg;
|
||
|
||
for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
|
||
DECL_ABSTRACT_ORIGIN (arg) = arg;
|
||
if (DECL_INITIAL (decl) != NULL_TREE
|
||
&& DECL_INITIAL (decl) != error_mark_node)
|
||
set_block_origin_self (DECL_INITIAL (decl));
|
||
}
|
||
}
|
||
}
|
||
|
||
/* Given a pointer to some BLOCK node, and a boolean value to set the
|
||
"abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
|
||
the given block, and for all local decls and all local sub-blocks
|
||
(recursively) which are contained therein. */
|
||
|
||
static void
|
||
set_block_abstract_flags (tree stmt, int setting)
|
||
{
|
||
tree local_decl;
|
||
tree subblock;
|
||
|
||
BLOCK_ABSTRACT (stmt) = setting;
|
||
|
||
for (local_decl = BLOCK_VARS (stmt);
|
||
local_decl != NULL_TREE;
|
||
local_decl = TREE_CHAIN (local_decl))
|
||
set_decl_abstract_flags (local_decl, setting);
|
||
|
||
for (subblock = BLOCK_SUBBLOCKS (stmt);
|
||
subblock != NULL_TREE;
|
||
subblock = BLOCK_CHAIN (subblock))
|
||
set_block_abstract_flags (subblock, setting);
|
||
}
|
||
|
||
/* Given a pointer to some ..._DECL node, and a boolean value to set the
|
||
"abstract" flags to, set that value into the DECL_ABSTRACT flag for the
|
||
given decl, and (in the case where the decl is a FUNCTION_DECL) also
|
||
set the abstract flags for all of the parameters, local vars, local
|
||
blocks and sub-blocks (recursively) to the same setting. */
|
||
|
||
void
|
||
set_decl_abstract_flags (tree decl, int setting)
|
||
{
|
||
DECL_ABSTRACT (decl) = setting;
|
||
if (TREE_CODE (decl) == FUNCTION_DECL)
|
||
{
|
||
tree arg;
|
||
|
||
for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
|
||
DECL_ABSTRACT (arg) = setting;
|
||
if (DECL_INITIAL (decl) != NULL_TREE
|
||
&& DECL_INITIAL (decl) != error_mark_node)
|
||
set_block_abstract_flags (DECL_INITIAL (decl), setting);
|
||
}
|
||
}
|
||
|
||
/* Functions to keep track of the values hard regs had at the start of
|
||
the function. */
|
||
|
||
rtx
|
||
get_hard_reg_initial_reg (struct function *fun, rtx reg)
|
||
{
|
||
struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
|
||
int i;
|
||
|
||
if (ivs == 0)
|
||
return NULL_RTX;
|
||
|
||
for (i = 0; i < ivs->num_entries; i++)
|
||
if (rtx_equal_p (ivs->entries[i].pseudo, reg))
|
||
return ivs->entries[i].hard_reg;
|
||
|
||
return NULL_RTX;
|
||
}
|
||
|
||
rtx
|
||
has_func_hard_reg_initial_val (struct function *fun, rtx reg)
|
||
{
|
||
struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
|
||
int i;
|
||
|
||
if (ivs == 0)
|
||
return NULL_RTX;
|
||
|
||
for (i = 0; i < ivs->num_entries; i++)
|
||
if (rtx_equal_p (ivs->entries[i].hard_reg, reg))
|
||
return ivs->entries[i].pseudo;
|
||
|
||
return NULL_RTX;
|
||
}
|
||
|
||
rtx
|
||
get_func_hard_reg_initial_val (struct function *fun, rtx reg)
|
||
{
|
||
struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
|
||
rtx rv = has_func_hard_reg_initial_val (fun, reg);
|
||
|
||
if (rv)
|
||
return rv;
|
||
|
||
if (ivs == 0)
|
||
{
|
||
fun->hard_reg_initial_vals = ggc_alloc (sizeof (initial_value_struct));
|
||
ivs = fun->hard_reg_initial_vals;
|
||
ivs->num_entries = 0;
|
||
ivs->max_entries = 5;
|
||
ivs->entries = ggc_alloc (5 * sizeof (initial_value_pair));
|
||
}
|
||
|
||
if (ivs->num_entries >= ivs->max_entries)
|
||
{
|
||
ivs->max_entries += 5;
|
||
ivs->entries = ggc_realloc (ivs->entries,
|
||
ivs->max_entries
|
||
* sizeof (initial_value_pair));
|
||
}
|
||
|
||
ivs->entries[ivs->num_entries].hard_reg = reg;
|
||
ivs->entries[ivs->num_entries].pseudo = gen_reg_rtx (GET_MODE (reg));
|
||
|
||
return ivs->entries[ivs->num_entries++].pseudo;
|
||
}
|
||
|
||
rtx
|
||
get_hard_reg_initial_val (enum machine_mode mode, int regno)
|
||
{
|
||
return get_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno));
|
||
}
|
||
|
||
rtx
|
||
has_hard_reg_initial_val (enum machine_mode mode, int regno)
|
||
{
|
||
return has_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno));
|
||
}
|
||
|
||
void
|
||
emit_initial_value_sets (void)
|
||
{
|
||
struct initial_value_struct *ivs = cfun->hard_reg_initial_vals;
|
||
int i;
|
||
rtx seq;
|
||
|
||
if (ivs == 0)
|
||
return;
|
||
|
||
start_sequence ();
|
||
for (i = 0; i < ivs->num_entries; i++)
|
||
emit_move_insn (ivs->entries[i].pseudo, ivs->entries[i].hard_reg);
|
||
seq = get_insns ();
|
||
end_sequence ();
|
||
|
||
emit_insn_after (seq, entry_of_function ());
|
||
}
|
||
|
||
/* If the backend knows where to allocate pseudos for hard
|
||
register initial values, register these allocations now. */
|
||
void
|
||
allocate_initial_values (rtx *reg_equiv_memory_loc ATTRIBUTE_UNUSED)
|
||
{
|
||
#ifdef ALLOCATE_INITIAL_VALUE
|
||
struct initial_value_struct *ivs = cfun->hard_reg_initial_vals;
|
||
int i;
|
||
|
||
if (ivs == 0)
|
||
return;
|
||
|
||
for (i = 0; i < ivs->num_entries; i++)
|
||
{
|
||
int regno = REGNO (ivs->entries[i].pseudo);
|
||
rtx x = ALLOCATE_INITIAL_VALUE (ivs->entries[i].hard_reg);
|
||
|
||
if (x == NULL_RTX || REG_N_SETS (REGNO (ivs->entries[i].pseudo)) > 1)
|
||
; /* Do nothing. */
|
||
else if (MEM_P (x))
|
||
reg_equiv_memory_loc[regno] = x;
|
||
else if (REG_P (x))
|
||
{
|
||
reg_renumber[regno] = REGNO (x);
|
||
/* Poke the regno right into regno_reg_rtx
|
||
so that even fixed regs are accepted. */
|
||
REGNO (ivs->entries[i].pseudo) = REGNO (x);
|
||
}
|
||
else abort ();
|
||
}
|
||
#endif
|
||
}
|
||
|
||
#include "gt-integrate.h"
|