/* Standard problems for dataflow support routines.
|
/* Standard problems for dataflow support routines.
|
Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
Originally contributed by Michael P. Hayes
|
Originally contributed by Michael P. Hayes
|
(m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
|
(m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
|
Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
|
Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
|
and Kenneth Zadeck (zadeck@naturalbridge.com).
|
and Kenneth Zadeck (zadeck@naturalbridge.com).
|
|
|
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/>. */
|
|
|
#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 "rtl.h"
|
#include "rtl.h"
|
#include "tm_p.h"
|
#include "tm_p.h"
|
#include "insn-config.h"
|
#include "insn-config.h"
|
#include "recog.h"
|
#include "recog.h"
|
#include "function.h"
|
#include "function.h"
|
#include "regs.h"
|
#include "regs.h"
|
#include "output.h"
|
#include "output.h"
|
#include "alloc-pool.h"
|
#include "alloc-pool.h"
|
#include "flags.h"
|
#include "flags.h"
|
#include "hard-reg-set.h"
|
#include "hard-reg-set.h"
|
#include "basic-block.h"
|
#include "basic-block.h"
|
#include "sbitmap.h"
|
#include "sbitmap.h"
|
#include "bitmap.h"
|
#include "bitmap.h"
|
#include "timevar.h"
|
#include "timevar.h"
|
#include "df.h"
|
#include "df.h"
|
#include "vecprim.h"
|
#include "vecprim.h"
|
#include "except.h"
|
#include "except.h"
|
|
|
#if 0
|
#if 0
|
#define REG_DEAD_DEBUGGING
|
#define REG_DEAD_DEBUGGING
|
#endif
|
#endif
|
|
|
#define DF_SPARSE_THRESHOLD 32
|
#define DF_SPARSE_THRESHOLD 32
|
|
|
static bitmap seen_in_block = NULL;
|
static bitmap seen_in_block = NULL;
|
static bitmap seen_in_insn = NULL;
|
static bitmap seen_in_insn = NULL;
|
static void df_ri_dump (struct dataflow *, FILE *);
|
static void df_ri_dump (struct dataflow *, FILE *);
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
Public functions access functions for the dataflow problems.
|
Public functions access functions for the dataflow problems.
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* Create a du or ud chain from SRC to DST and link it into SRC. */
|
/* Create a du or ud chain from SRC to DST and link it into SRC. */
|
|
|
struct df_link *
|
struct df_link *
|
df_chain_create (struct dataflow *dflow, struct df_ref *src, struct df_ref *dst)
|
df_chain_create (struct dataflow *dflow, struct df_ref *src, struct df_ref *dst)
|
{
|
{
|
struct df_link *head = DF_REF_CHAIN (src);
|
struct df_link *head = DF_REF_CHAIN (src);
|
struct df_link *link = pool_alloc (dflow->block_pool);;
|
struct df_link *link = pool_alloc (dflow->block_pool);;
|
|
|
DF_REF_CHAIN (src) = link;
|
DF_REF_CHAIN (src) = link;
|
link->next = head;
|
link->next = head;
|
link->ref = dst;
|
link->ref = dst;
|
return link;
|
return link;
|
}
|
}
|
|
|
|
|
/* Delete a du or ud chain for REF. If LINK is NULL, delete all
|
/* Delete a du or ud chain for REF. If LINK is NULL, delete all
|
chains for ref and check to see if the reverse chains can also be
|
chains for ref and check to see if the reverse chains can also be
|
deleted. If LINK is not NULL it must be a link off of ref. In
|
deleted. If LINK is not NULL it must be a link off of ref. In
|
this case, the other end is not deleted. */
|
this case, the other end is not deleted. */
|
|
|
void
|
void
|
df_chain_unlink (struct dataflow *dflow, struct df_ref *ref, struct df_link *link)
|
df_chain_unlink (struct dataflow *dflow, struct df_ref *ref, struct df_link *link)
|
{
|
{
|
struct df_link *chain = DF_REF_CHAIN (ref);
|
struct df_link *chain = DF_REF_CHAIN (ref);
|
if (link)
|
if (link)
|
{
|
{
|
/* Link was the first element in the chain. */
|
/* Link was the first element in the chain. */
|
if (chain == link)
|
if (chain == link)
|
DF_REF_CHAIN (ref) = link->next;
|
DF_REF_CHAIN (ref) = link->next;
|
else
|
else
|
{
|
{
|
/* Link is an internal element in the chain. */
|
/* Link is an internal element in the chain. */
|
struct df_link *prev = chain;
|
struct df_link *prev = chain;
|
while (chain)
|
while (chain)
|
{
|
{
|
if (chain == link)
|
if (chain == link)
|
{
|
{
|
prev->next = chain->next;
|
prev->next = chain->next;
|
break;
|
break;
|
}
|
}
|
prev = chain;
|
prev = chain;
|
chain = chain->next;
|
chain = chain->next;
|
}
|
}
|
}
|
}
|
pool_free (dflow->block_pool, link);
|
pool_free (dflow->block_pool, link);
|
}
|
}
|
else
|
else
|
{
|
{
|
/* If chain is NULL here, it was because of a recursive call
|
/* If chain is NULL here, it was because of a recursive call
|
when the other flavor of chains was not built. Just run thru
|
when the other flavor of chains was not built. Just run thru
|
the entire chain calling the other side and then deleting the
|
the entire chain calling the other side and then deleting the
|
link. */
|
link. */
|
while (chain)
|
while (chain)
|
{
|
{
|
struct df_link *next = chain->next;
|
struct df_link *next = chain->next;
|
/* Delete the other side if it exists. */
|
/* Delete the other side if it exists. */
|
df_chain_unlink (dflow, chain->ref, chain);
|
df_chain_unlink (dflow, chain->ref, chain);
|
chain = next;
|
chain = next;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Copy the du or ud chain starting at FROM_REF and attach it to
|
/* Copy the du or ud chain starting at FROM_REF and attach it to
|
TO_REF. */
|
TO_REF. */
|
|
|
void
|
void
|
df_chain_copy (struct dataflow *dflow,
|
df_chain_copy (struct dataflow *dflow,
|
struct df_ref *to_ref,
|
struct df_ref *to_ref,
|
struct df_link *from_ref)
|
struct df_link *from_ref)
|
{
|
{
|
while (from_ref)
|
while (from_ref)
|
{
|
{
|
df_chain_create (dflow, to_ref, from_ref->ref);
|
df_chain_create (dflow, to_ref, from_ref->ref);
|
from_ref = from_ref->next;
|
from_ref = from_ref->next;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Get the live in set for BB no matter what problem happens to be
|
/* Get the live in set for BB no matter what problem happens to be
|
defined. */
|
defined. */
|
|
|
bitmap
|
bitmap
|
df_get_live_in (struct df *df, basic_block bb)
|
df_get_live_in (struct df *df, basic_block bb)
|
{
|
{
|
gcc_assert (df->problems_by_index[DF_LR]);
|
gcc_assert (df->problems_by_index[DF_LR]);
|
|
|
if (df->problems_by_index[DF_UREC])
|
if (df->problems_by_index[DF_UREC])
|
return DF_RA_LIVE_IN (df, bb);
|
return DF_RA_LIVE_IN (df, bb);
|
else if (df->problems_by_index[DF_UR])
|
else if (df->problems_by_index[DF_UR])
|
return DF_LIVE_IN (df, bb);
|
return DF_LIVE_IN (df, bb);
|
else
|
else
|
return DF_UPWARD_LIVE_IN (df, bb);
|
return DF_UPWARD_LIVE_IN (df, bb);
|
}
|
}
|
|
|
|
|
/* Get the live out set for BB no matter what problem happens to be
|
/* Get the live out set for BB no matter what problem happens to be
|
defined. */
|
defined. */
|
|
|
bitmap
|
bitmap
|
df_get_live_out (struct df *df, basic_block bb)
|
df_get_live_out (struct df *df, basic_block bb)
|
{
|
{
|
gcc_assert (df->problems_by_index[DF_LR]);
|
gcc_assert (df->problems_by_index[DF_LR]);
|
|
|
if (df->problems_by_index[DF_UREC])
|
if (df->problems_by_index[DF_UREC])
|
return DF_RA_LIVE_OUT (df, bb);
|
return DF_RA_LIVE_OUT (df, bb);
|
else if (df->problems_by_index[DF_UR])
|
else if (df->problems_by_index[DF_UR])
|
return DF_LIVE_OUT (df, bb);
|
return DF_LIVE_OUT (df, bb);
|
else
|
else
|
return DF_UPWARD_LIVE_OUT (df, bb);
|
return DF_UPWARD_LIVE_OUT (df, bb);
|
}
|
}
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
Utility functions.
|
Utility functions.
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* Generic versions to get the void* version of the block info. Only
|
/* Generic versions to get the void* version of the block info. Only
|
used inside the problem instance vectors. */
|
used inside the problem instance vectors. */
|
|
|
/* Grow the bb_info array. */
|
/* Grow the bb_info array. */
|
|
|
void
|
void
|
df_grow_bb_info (struct dataflow *dflow)
|
df_grow_bb_info (struct dataflow *dflow)
|
{
|
{
|
unsigned int new_size = last_basic_block + 1;
|
unsigned int new_size = last_basic_block + 1;
|
if (dflow->block_info_size < new_size)
|
if (dflow->block_info_size < new_size)
|
{
|
{
|
new_size += new_size / 4;
|
new_size += new_size / 4;
|
dflow->block_info = xrealloc (dflow->block_info,
|
dflow->block_info = xrealloc (dflow->block_info,
|
new_size *sizeof (void*));
|
new_size *sizeof (void*));
|
memset (dflow->block_info + dflow->block_info_size, 0,
|
memset (dflow->block_info + dflow->block_info_size, 0,
|
(new_size - dflow->block_info_size) *sizeof (void *));
|
(new_size - dflow->block_info_size) *sizeof (void *));
|
dflow->block_info_size = new_size;
|
dflow->block_info_size = new_size;
|
}
|
}
|
}
|
}
|
|
|
/* Dump a def-use or use-def chain for REF to FILE. */
|
/* Dump a def-use or use-def chain for REF to FILE. */
|
|
|
void
|
void
|
df_chain_dump (struct df_link *link, FILE *file)
|
df_chain_dump (struct df_link *link, FILE *file)
|
{
|
{
|
fprintf (file, "{ ");
|
fprintf (file, "{ ");
|
for (; link; link = link->next)
|
for (; link; link = link->next)
|
{
|
{
|
fprintf (file, "%c%d(bb %d insn %d) ",
|
fprintf (file, "%c%d(bb %d insn %d) ",
|
DF_REF_REG_DEF_P (link->ref) ? 'd' : 'u',
|
DF_REF_REG_DEF_P (link->ref) ? 'd' : 'u',
|
DF_REF_ID (link->ref),
|
DF_REF_ID (link->ref),
|
DF_REF_BBNO (link->ref),
|
DF_REF_BBNO (link->ref),
|
DF_REF_INSN (link->ref) ? DF_REF_INSN_UID (link->ref) : -1);
|
DF_REF_INSN (link->ref) ? DF_REF_INSN_UID (link->ref) : -1);
|
}
|
}
|
fprintf (file, "}");
|
fprintf (file, "}");
|
}
|
}
|
|
|
|
|
/* Print some basic block info as part of df_dump. */
|
/* Print some basic block info as part of df_dump. */
|
|
|
void
|
void
|
df_print_bb_index (basic_block bb, FILE *file)
|
df_print_bb_index (basic_block bb, FILE *file)
|
{
|
{
|
edge e;
|
edge e;
|
edge_iterator ei;
|
edge_iterator ei;
|
|
|
fprintf (file, "( ");
|
fprintf (file, "( ");
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
{
|
{
|
basic_block pred = e->src;
|
basic_block pred = e->src;
|
fprintf (file, "%d ", pred->index);
|
fprintf (file, "%d ", pred->index);
|
}
|
}
|
fprintf (file, ")->[%d]->( ", bb->index);
|
fprintf (file, ")->[%d]->( ", bb->index);
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
{
|
{
|
basic_block succ = e->dest;
|
basic_block succ = e->dest;
|
fprintf (file, "%d ", succ->index);
|
fprintf (file, "%d ", succ->index);
|
}
|
}
|
fprintf (file, ")\n");
|
fprintf (file, ")\n");
|
}
|
}
|
|
|
|
|
/* Return a bitmap for REGNO from the cache MAPS. The bitmap is to
|
/* Return a bitmap for REGNO from the cache MAPS. The bitmap is to
|
contain COUNT bits starting at START. These bitmaps are not to be
|
contain COUNT bits starting at START. These bitmaps are not to be
|
changed since there is a cache of them. */
|
changed since there is a cache of them. */
|
|
|
static inline bitmap
|
static inline bitmap
|
df_ref_bitmap (bitmap *maps, unsigned int regno, int start, int count)
|
df_ref_bitmap (bitmap *maps, unsigned int regno, int start, int count)
|
{
|
{
|
bitmap ids = maps[regno];
|
bitmap ids = maps[regno];
|
if (!ids)
|
if (!ids)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
unsigned int end = start + count;;
|
unsigned int end = start + count;;
|
ids = BITMAP_ALLOC (NULL);
|
ids = BITMAP_ALLOC (NULL);
|
maps[regno] = ids;
|
maps[regno] = ids;
|
for (i = start; i < end; i++)
|
for (i = start; i < end; i++)
|
bitmap_set_bit (ids, i);
|
bitmap_set_bit (ids, i);
|
}
|
}
|
return ids;
|
return ids;
|
}
|
}
|
|
|
|
|
/* Make sure that the seen_in_insn and seen_in_block sbitmaps are set
|
/* Make sure that the seen_in_insn and seen_in_block sbitmaps are set
|
up correctly. */
|
up correctly. */
|
|
|
static void
|
static void
|
df_set_seen (void)
|
df_set_seen (void)
|
{
|
{
|
seen_in_block = BITMAP_ALLOC (NULL);
|
seen_in_block = BITMAP_ALLOC (NULL);
|
seen_in_insn = BITMAP_ALLOC (NULL);
|
seen_in_insn = BITMAP_ALLOC (NULL);
|
}
|
}
|
|
|
|
|
static void
|
static void
|
df_unset_seen (void)
|
df_unset_seen (void)
|
{
|
{
|
BITMAP_FREE (seen_in_block);
|
BITMAP_FREE (seen_in_block);
|
BITMAP_FREE (seen_in_insn);
|
BITMAP_FREE (seen_in_insn);
|
}
|
}
|
|
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
REACHING USES
|
REACHING USES
|
|
|
Find the locations in the function where each use site for a pseudo
|
Find the locations in the function where each use site for a pseudo
|
can reach backwards. In and out bitvectors are built for each basic
|
can reach backwards. In and out bitvectors are built for each basic
|
block. The id field in the ref is used to index into these sets.
|
block. The id field in the ref is used to index into these sets.
|
See df.h for details.
|
See df.h for details.
|
|
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* This problem plays a large number of games for the sake of
|
/* This problem plays a large number of games for the sake of
|
efficiency.
|
efficiency.
|
|
|
1) The order of the bits in the bitvectors. After the scanning
|
1) The order of the bits in the bitvectors. After the scanning
|
phase, all of the uses are sorted. All of the uses for the reg 0
|
phase, all of the uses are sorted. All of the uses for the reg 0
|
are first, followed by all uses for reg 1 and so on.
|
are first, followed by all uses for reg 1 and so on.
|
|
|
2) There are two kill sets, one if the number of uses is less or
|
2) There are two kill sets, one if the number of uses is less or
|
equal to DF_SPARSE_THRESHOLD and another if it is greater.
|
equal to DF_SPARSE_THRESHOLD and another if it is greater.
|
|
|
<= : There is a bitmap for each register, uses_sites[N], that is
|
<= : There is a bitmap for each register, uses_sites[N], that is
|
built on demand. This bitvector contains a 1 for each use or reg
|
built on demand. This bitvector contains a 1 for each use or reg
|
N.
|
N.
|
|
|
> : One level of indirection is used to keep from generating long
|
> : One level of indirection is used to keep from generating long
|
strings of 1 bits in the kill sets. Bitvectors that are indexed
|
strings of 1 bits in the kill sets. Bitvectors that are indexed
|
by the regnum are used to represent that there is a killing def
|
by the regnum are used to represent that there is a killing def
|
for the register. The confluence and transfer functions use
|
for the register. The confluence and transfer functions use
|
these along with the bitmap_clear_range call to remove ranges of
|
these along with the bitmap_clear_range call to remove ranges of
|
bits without actually generating a knockout vector.
|
bits without actually generating a knockout vector.
|
|
|
The kill and sparse_kill and the dense_invalidated_by_call and
|
The kill and sparse_kill and the dense_invalidated_by_call and
|
sparse_invalidated_by call both play this game. */
|
sparse_invalidated_by call both play this game. */
|
|
|
/* Private data used to compute the solution for this problem. These
|
/* Private data used to compute the solution for this problem. These
|
data structures are not accessible outside of this module. */
|
data structures are not accessible outside of this module. */
|
struct df_ru_problem_data
|
struct df_ru_problem_data
|
{
|
{
|
|
|
bitmap *use_sites; /* Bitmap of uses for each pseudo. */
|
bitmap *use_sites; /* Bitmap of uses for each pseudo. */
|
unsigned int use_sites_size; /* Size of use_sites. */
|
unsigned int use_sites_size; /* Size of use_sites. */
|
/* The set of defs to regs invalidated by call. */
|
/* The set of defs to regs invalidated by call. */
|
bitmap sparse_invalidated_by_call;
|
bitmap sparse_invalidated_by_call;
|
/* The set of defs to regs invalidated by call for ru. */
|
/* The set of defs to regs invalidated by call for ru. */
|
bitmap dense_invalidated_by_call;
|
bitmap dense_invalidated_by_call;
|
};
|
};
|
|
|
/* Get basic block info. */
|
/* Get basic block info. */
|
|
|
struct df_ru_bb_info *
|
struct df_ru_bb_info *
|
df_ru_get_bb_info (struct dataflow *dflow, unsigned int index)
|
df_ru_get_bb_info (struct dataflow *dflow, unsigned int index)
|
{
|
{
|
return (struct df_ru_bb_info *) dflow->block_info[index];
|
return (struct df_ru_bb_info *) dflow->block_info[index];
|
}
|
}
|
|
|
|
|
/* Set basic block info. */
|
/* Set basic block info. */
|
|
|
static void
|
static void
|
df_ru_set_bb_info (struct dataflow *dflow, unsigned int index,
|
df_ru_set_bb_info (struct dataflow *dflow, unsigned int index,
|
struct df_ru_bb_info *bb_info)
|
struct df_ru_bb_info *bb_info)
|
{
|
{
|
dflow->block_info[index] = bb_info;
|
dflow->block_info[index] = bb_info;
|
}
|
}
|
|
|
|
|
/* Free basic block info. */
|
/* Free basic block info. */
|
|
|
static void
|
static void
|
df_ru_free_bb_info (struct dataflow *dflow,
|
df_ru_free_bb_info (struct dataflow *dflow,
|
basic_block bb ATTRIBUTE_UNUSED,
|
basic_block bb ATTRIBUTE_UNUSED,
|
void *vbb_info)
|
void *vbb_info)
|
{
|
{
|
struct df_ru_bb_info *bb_info = (struct df_ru_bb_info *) vbb_info;
|
struct df_ru_bb_info *bb_info = (struct df_ru_bb_info *) vbb_info;
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
pool_free (dflow->block_pool, bb_info);
|
pool_free (dflow->block_pool, bb_info);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
not touched unless the block is new. */
|
not touched unless the block is new. */
|
|
|
static void
|
static void
|
df_ru_alloc (struct dataflow *dflow,
|
df_ru_alloc (struct dataflow *dflow,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap all_blocks)
|
bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int reg_size = max_reg_num ();
|
unsigned int reg_size = max_reg_num ();
|
|
|
if (!dflow->block_pool)
|
if (!dflow->block_pool)
|
dflow->block_pool = create_alloc_pool ("df_ru_block pool",
|
dflow->block_pool = create_alloc_pool ("df_ru_block pool",
|
sizeof (struct df_ru_bb_info), 50);
|
sizeof (struct df_ru_bb_info), 50);
|
|
|
if (dflow->problem_data)
|
if (dflow->problem_data)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
struct df_ru_problem_data *problem_data
|
struct df_ru_problem_data *problem_data
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
|
|
for (i = 0; i < problem_data->use_sites_size; i++)
|
for (i = 0; i < problem_data->use_sites_size; i++)
|
{
|
{
|
bitmap bm = problem_data->use_sites[i];
|
bitmap bm = problem_data->use_sites[i];
|
if (bm)
|
if (bm)
|
{
|
{
|
BITMAP_FREE (bm);
|
BITMAP_FREE (bm);
|
problem_data->use_sites[i] = NULL;
|
problem_data->use_sites[i] = NULL;
|
}
|
}
|
}
|
}
|
|
|
if (problem_data->use_sites_size < reg_size)
|
if (problem_data->use_sites_size < reg_size)
|
{
|
{
|
problem_data->use_sites
|
problem_data->use_sites
|
= xrealloc (problem_data->use_sites, reg_size * sizeof (bitmap));
|
= xrealloc (problem_data->use_sites, reg_size * sizeof (bitmap));
|
memset (problem_data->use_sites + problem_data->use_sites_size, 0,
|
memset (problem_data->use_sites + problem_data->use_sites_size, 0,
|
(reg_size - problem_data->use_sites_size) * sizeof (bitmap));
|
(reg_size - problem_data->use_sites_size) * sizeof (bitmap));
|
problem_data->use_sites_size = reg_size;
|
problem_data->use_sites_size = reg_size;
|
}
|
}
|
|
|
bitmap_clear (problem_data->sparse_invalidated_by_call);
|
bitmap_clear (problem_data->sparse_invalidated_by_call);
|
bitmap_clear (problem_data->dense_invalidated_by_call);
|
bitmap_clear (problem_data->dense_invalidated_by_call);
|
}
|
}
|
else
|
else
|
{
|
{
|
struct df_ru_problem_data *problem_data = XNEW (struct df_ru_problem_data);
|
struct df_ru_problem_data *problem_data = XNEW (struct df_ru_problem_data);
|
dflow->problem_data = problem_data;
|
dflow->problem_data = problem_data;
|
|
|
problem_data->use_sites = XCNEWVEC (bitmap, reg_size);
|
problem_data->use_sites = XCNEWVEC (bitmap, reg_size);
|
problem_data->use_sites_size = reg_size;
|
problem_data->use_sites_size = reg_size;
|
problem_data->sparse_invalidated_by_call = BITMAP_ALLOC (NULL);
|
problem_data->sparse_invalidated_by_call = BITMAP_ALLOC (NULL);
|
problem_data->dense_invalidated_by_call = BITMAP_ALLOC (NULL);
|
problem_data->dense_invalidated_by_call = BITMAP_ALLOC (NULL);
|
}
|
}
|
|
|
df_grow_bb_info (dflow);
|
df_grow_bb_info (dflow);
|
|
|
/* Because of the clustering of all def sites for the same pseudo,
|
/* Because of the clustering of all def sites for the same pseudo,
|
we have to process all of the blocks before doing the
|
we have to process all of the blocks before doing the
|
analysis. */
|
analysis. */
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->sparse_kill);
|
bitmap_clear (bb_info->sparse_kill);
|
bitmap_clear (bb_info->gen);
|
bitmap_clear (bb_info->gen);
|
}
|
}
|
else
|
else
|
{
|
{
|
bb_info = (struct df_ru_bb_info *) pool_alloc (dflow->block_pool);
|
bb_info = (struct df_ru_bb_info *) pool_alloc (dflow->block_pool);
|
df_ru_set_bb_info (dflow, bb_index, bb_info);
|
df_ru_set_bb_info (dflow, bb_index, bb_info);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->sparse_kill = BITMAP_ALLOC (NULL);
|
bb_info->sparse_kill = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Process a list of DEFs for df_ru_bb_local_compute. */
|
/* Process a list of DEFs for df_ru_bb_local_compute. */
|
|
|
static void
|
static void
|
df_ru_bb_local_compute_process_def (struct dataflow *dflow,
|
df_ru_bb_local_compute_process_def (struct dataflow *dflow,
|
struct df_ru_bb_info *bb_info,
|
struct df_ru_bb_info *bb_info,
|
struct df_ref *def,
|
struct df_ref *def,
|
enum df_ref_flags top_flag)
|
enum df_ref_flags top_flag)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
while (def)
|
while (def)
|
{
|
{
|
if ((top_flag == (DF_REF_FLAGS (def) & DF_REF_AT_TOP))
|
if ((top_flag == (DF_REF_FLAGS (def) & DF_REF_AT_TOP))
|
/* If the def is to only part of the reg, it is as if it did
|
/* If the def is to only part of the reg, it is as if it did
|
not happen, since some of the bits may get thru. */
|
not happen, since some of the bits may get thru. */
|
&& (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL)))
|
&& (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL)))
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int begin = DF_REG_USE_GET (df, regno)->begin;
|
unsigned int begin = DF_REG_USE_GET (df, regno)->begin;
|
unsigned int n_uses = DF_REG_USE_GET (df, regno)->n_refs;
|
unsigned int n_uses = DF_REG_USE_GET (df, regno)->n_refs;
|
if (!bitmap_bit_p (seen_in_block, regno))
|
if (!bitmap_bit_p (seen_in_block, regno))
|
{
|
{
|
/* The first def for regno in the insn, causes the kill
|
/* The first def for regno in the insn, causes the kill
|
info to be generated. Do not modify the gen set
|
info to be generated. Do not modify the gen set
|
because the only values in it are the uses from here
|
because the only values in it are the uses from here
|
to the top of the block and this def does not effect
|
to the top of the block and this def does not effect
|
them. */
|
them. */
|
if (!bitmap_bit_p (seen_in_insn, regno))
|
if (!bitmap_bit_p (seen_in_insn, regno))
|
{
|
{
|
if (n_uses > DF_SPARSE_THRESHOLD)
|
if (n_uses > DF_SPARSE_THRESHOLD)
|
bitmap_set_bit (bb_info->sparse_kill, regno);
|
bitmap_set_bit (bb_info->sparse_kill, regno);
|
else
|
else
|
{
|
{
|
struct df_ru_problem_data * problem_data
|
struct df_ru_problem_data * problem_data
|
= (struct df_ru_problem_data *)dflow->problem_data;
|
= (struct df_ru_problem_data *)dflow->problem_data;
|
bitmap uses
|
bitmap uses
|
= df_ref_bitmap (problem_data->use_sites, regno,
|
= df_ref_bitmap (problem_data->use_sites, regno,
|
begin, n_uses);
|
begin, n_uses);
|
bitmap_ior_into (bb_info->kill, uses);
|
bitmap_ior_into (bb_info->kill, uses);
|
}
|
}
|
}
|
}
|
bitmap_set_bit (seen_in_insn, regno);
|
bitmap_set_bit (seen_in_insn, regno);
|
}
|
}
|
}
|
}
|
def = def->next_ref;
|
def = def->next_ref;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Process a list of USEs for df_ru_bb_local_compute. */
|
/* Process a list of USEs for df_ru_bb_local_compute. */
|
|
|
static void
|
static void
|
df_ru_bb_local_compute_process_use (struct df_ru_bb_info *bb_info,
|
df_ru_bb_local_compute_process_use (struct df_ru_bb_info *bb_info,
|
struct df_ref *use,
|
struct df_ref *use,
|
enum df_ref_flags top_flag)
|
enum df_ref_flags top_flag)
|
{
|
{
|
while (use)
|
while (use)
|
{
|
{
|
if (top_flag == (DF_REF_FLAGS (use) & DF_REF_AT_TOP))
|
if (top_flag == (DF_REF_FLAGS (use) & DF_REF_AT_TOP))
|
{
|
{
|
/* Add use to set of gens in this BB unless we have seen a
|
/* Add use to set of gens in this BB unless we have seen a
|
def in a previous instruction. */
|
def in a previous instruction. */
|
unsigned int regno = DF_REF_REGNO (use);
|
unsigned int regno = DF_REF_REGNO (use);
|
if (!bitmap_bit_p (seen_in_block, regno))
|
if (!bitmap_bit_p (seen_in_block, regno))
|
bitmap_set_bit (bb_info->gen, DF_REF_ID (use));
|
bitmap_set_bit (bb_info->gen, DF_REF_ID (use));
|
}
|
}
|
use = use->next_ref;
|
use = use->next_ref;
|
}
|
}
|
}
|
}
|
|
|
/* Compute local reaching use (upward exposed use) info for basic
|
/* Compute local reaching use (upward exposed use) info for basic
|
block BB. USE_INFO->REGS[R] caches the set of uses for register R. */
|
block BB. USE_INFO->REGS[R] caches the set of uses for register R. */
|
static void
|
static void
|
df_ru_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
df_ru_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
rtx insn;
|
rtx insn;
|
|
|
/* Set when a def for regno is seen. */
|
/* Set when a def for regno is seen. */
|
bitmap_clear (seen_in_block);
|
bitmap_clear (seen_in_block);
|
bitmap_clear (seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
|
|
#ifdef EH_USES
|
#ifdef EH_USES
|
/* Variables defined in the prolog that are used by the exception
|
/* Variables defined in the prolog that are used by the exception
|
handler. */
|
handler. */
|
df_ru_bb_local_compute_process_use (bb_info,
|
df_ru_bb_local_compute_process_use (bb_info,
|
df_get_artificial_uses (df, bb_index),
|
df_get_artificial_uses (df, bb_index),
|
DF_REF_AT_TOP);
|
DF_REF_AT_TOP);
|
#endif
|
#endif
|
df_ru_bb_local_compute_process_def (dflow, bb_info,
|
df_ru_bb_local_compute_process_def (dflow, bb_info,
|
df_get_artificial_defs (df, bb_index),
|
df_get_artificial_defs (df, bb_index),
|
DF_REF_AT_TOP);
|
DF_REF_AT_TOP);
|
|
|
FOR_BB_INSNS (bb, insn)
|
FOR_BB_INSNS (bb, insn)
|
{
|
{
|
unsigned int uid = INSN_UID (insn);
|
unsigned int uid = INSN_UID (insn);
|
if (!INSN_P (insn))
|
if (!INSN_P (insn))
|
continue;
|
continue;
|
|
|
df_ru_bb_local_compute_process_use (bb_info,
|
df_ru_bb_local_compute_process_use (bb_info,
|
DF_INSN_UID_USES (df, uid), 0);
|
DF_INSN_UID_USES (df, uid), 0);
|
|
|
df_ru_bb_local_compute_process_def (dflow, bb_info,
|
df_ru_bb_local_compute_process_def (dflow, bb_info,
|
DF_INSN_UID_DEFS (df, uid), 0);
|
DF_INSN_UID_DEFS (df, uid), 0);
|
|
|
bitmap_ior_into (seen_in_block, seen_in_insn);
|
bitmap_ior_into (seen_in_block, seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
}
|
}
|
|
|
/* Process the hardware registers that are always live. */
|
/* Process the hardware registers that are always live. */
|
df_ru_bb_local_compute_process_use (bb_info,
|
df_ru_bb_local_compute_process_use (bb_info,
|
df_get_artificial_uses (df, bb_index), 0);
|
df_get_artificial_uses (df, bb_index), 0);
|
|
|
df_ru_bb_local_compute_process_def (dflow, bb_info,
|
df_ru_bb_local_compute_process_def (dflow, bb_info,
|
df_get_artificial_defs (df, bb_index), 0);
|
df_get_artificial_defs (df, bb_index), 0);
|
}
|
}
|
|
|
|
|
/* Compute local reaching use (upward exposed use) info for each basic
|
/* Compute local reaching use (upward exposed use) info for each basic
|
block within BLOCKS. */
|
block within BLOCKS. */
|
static void
|
static void
|
df_ru_local_compute (struct dataflow *dflow,
|
df_ru_local_compute (struct dataflow *dflow,
|
bitmap all_blocks,
|
bitmap all_blocks,
|
bitmap rescan_blocks ATTRIBUTE_UNUSED)
|
bitmap rescan_blocks ATTRIBUTE_UNUSED)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
struct df_ru_problem_data *problem_data
|
struct df_ru_problem_data *problem_data
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
|
|
df_set_seen ();
|
df_set_seen ();
|
|
|
if (!df->use_info.refs_organized)
|
if (!df->use_info.refs_organized)
|
df_reorganize_refs (&df->use_info);
|
df_reorganize_refs (&df->use_info);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
df_ru_bb_local_compute (dflow, bb_index);
|
df_ru_bb_local_compute (dflow, bb_index);
|
}
|
}
|
|
|
/* Set up the knockout bit vectors to be applied across EH_EDGES. */
|
/* Set up the knockout bit vectors to be applied across EH_EDGES. */
|
EXECUTE_IF_SET_IN_BITMAP (df_invalidated_by_call, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (df_invalidated_by_call, 0, regno, bi)
|
{
|
{
|
struct df_reg_info *reg_info = DF_REG_USE_GET (df, regno);
|
struct df_reg_info *reg_info = DF_REG_USE_GET (df, regno);
|
if (reg_info->n_refs > DF_SPARSE_THRESHOLD)
|
if (reg_info->n_refs > DF_SPARSE_THRESHOLD)
|
bitmap_set_bit (sparse_invalidated, regno);
|
bitmap_set_bit (sparse_invalidated, regno);
|
else
|
else
|
{
|
{
|
bitmap defs = df_ref_bitmap (problem_data->use_sites, regno,
|
bitmap defs = df_ref_bitmap (problem_data->use_sites, regno,
|
reg_info->begin, reg_info->n_refs);
|
reg_info->begin, reg_info->n_refs);
|
bitmap_ior_into (dense_invalidated, defs);
|
bitmap_ior_into (dense_invalidated, defs);
|
}
|
}
|
}
|
}
|
|
|
df_unset_seen ();
|
df_unset_seen ();
|
}
|
}
|
|
|
|
|
/* Initialize the solution bit vectors for problem. */
|
/* Initialize the solution bit vectors for problem. */
|
|
|
static void
|
static void
|
df_ru_init_solution (struct dataflow *dflow, bitmap all_blocks)
|
df_ru_init_solution (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
bitmap_copy (bb_info->in, bb_info->gen);
|
bitmap_copy (bb_info->in, bb_info->gen);
|
bitmap_clear (bb_info->out);
|
bitmap_clear (bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Out of target gets or of in of source. */
|
/* Out of target gets or of in of source. */
|
|
|
static void
|
static void
|
df_ru_confluence_n (struct dataflow *dflow, edge e)
|
df_ru_confluence_n (struct dataflow *dflow, edge e)
|
{
|
{
|
bitmap op1 = df_ru_get_bb_info (dflow, e->src->index)->out;
|
bitmap op1 = df_ru_get_bb_info (dflow, e->src->index)->out;
|
bitmap op2 = df_ru_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op2 = df_ru_get_bb_info (dflow, e->dest->index)->in;
|
|
|
if (e->flags & EDGE_EH)
|
if (e->flags & EDGE_EH)
|
{
|
{
|
struct df_ru_problem_data *problem_data
|
struct df_ru_problem_data *problem_data
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
|
|
bitmap_copy (tmp, op2);
|
bitmap_copy (tmp, op2);
|
bitmap_and_compl_into (tmp, dense_invalidated);
|
bitmap_and_compl_into (tmp, dense_invalidated);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (sparse_invalidated, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (sparse_invalidated, 0, regno, bi)
|
{
|
{
|
bitmap_clear_range (tmp,
|
bitmap_clear_range (tmp,
|
DF_REG_USE_GET (df, regno)->begin,
|
DF_REG_USE_GET (df, regno)->begin,
|
DF_REG_USE_GET (df, regno)->n_refs);
|
DF_REG_USE_GET (df, regno)->n_refs);
|
}
|
}
|
bitmap_ior_into (op1, tmp);
|
bitmap_ior_into (op1, tmp);
|
BITMAP_FREE (tmp);
|
BITMAP_FREE (tmp);
|
}
|
}
|
else
|
else
|
bitmap_ior_into (op1, op2);
|
bitmap_ior_into (op1, op2);
|
}
|
}
|
|
|
|
|
/* Transfer function. */
|
/* Transfer function. */
|
|
|
static bool
|
static bool
|
df_ru_transfer_function (struct dataflow *dflow, int bb_index)
|
df_ru_transfer_function (struct dataflow *dflow, int bb_index)
|
{
|
{
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb_index);
|
unsigned int regno;
|
unsigned int regno;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
bitmap in = bb_info->in;
|
bitmap in = bb_info->in;
|
bitmap out = bb_info->out;
|
bitmap out = bb_info->out;
|
bitmap gen = bb_info->gen;
|
bitmap gen = bb_info->gen;
|
bitmap kill = bb_info->kill;
|
bitmap kill = bb_info->kill;
|
bitmap sparse_kill = bb_info->sparse_kill;
|
bitmap sparse_kill = bb_info->sparse_kill;
|
|
|
if (bitmap_empty_p (sparse_kill))
|
if (bitmap_empty_p (sparse_kill))
|
return bitmap_ior_and_compl (in, gen, out, kill);
|
return bitmap_ior_and_compl (in, gen, out, kill);
|
else
|
else
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
bool changed = false;
|
bool changed = false;
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap_copy (tmp, out);
|
bitmap_copy (tmp, out);
|
EXECUTE_IF_SET_IN_BITMAP (sparse_kill, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (sparse_kill, 0, regno, bi)
|
{
|
{
|
bitmap_clear_range (tmp,
|
bitmap_clear_range (tmp,
|
DF_REG_USE_GET (df, regno)->begin,
|
DF_REG_USE_GET (df, regno)->begin,
|
DF_REG_USE_GET (df, regno)->n_refs);
|
DF_REG_USE_GET (df, regno)->n_refs);
|
}
|
}
|
bitmap_and_compl_into (tmp, kill);
|
bitmap_and_compl_into (tmp, kill);
|
bitmap_ior_into (tmp, gen);
|
bitmap_ior_into (tmp, gen);
|
changed = !bitmap_equal_p (tmp, in);
|
changed = !bitmap_equal_p (tmp, in);
|
if (changed)
|
if (changed)
|
{
|
{
|
BITMAP_FREE (in);
|
BITMAP_FREE (in);
|
bb_info->in = tmp;
|
bb_info->in = tmp;
|
}
|
}
|
else
|
else
|
BITMAP_FREE (tmp);
|
BITMAP_FREE (tmp);
|
return changed;
|
return changed;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Free all storage associated with the problem. */
|
/* Free all storage associated with the problem. */
|
|
|
static void
|
static void
|
df_ru_free (struct dataflow *dflow)
|
df_ru_free (struct dataflow *dflow)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
struct df_ru_problem_data *problem_data
|
struct df_ru_problem_data *problem_data
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
|
|
if (problem_data)
|
if (problem_data)
|
{
|
{
|
for (i = 0; i < dflow->block_info_size; i++)
|
for (i = 0; i < dflow->block_info_size; i++)
|
{
|
{
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, i);
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, i);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
|
|
for (i = 0; i < problem_data->use_sites_size; i++)
|
for (i = 0; i < problem_data->use_sites_size; i++)
|
{
|
{
|
bitmap bm = problem_data->use_sites[i];
|
bitmap bm = problem_data->use_sites[i];
|
if (bm)
|
if (bm)
|
BITMAP_FREE (bm);
|
BITMAP_FREE (bm);
|
}
|
}
|
|
|
free (problem_data->use_sites);
|
free (problem_data->use_sites);
|
BITMAP_FREE (problem_data->sparse_invalidated_by_call);
|
BITMAP_FREE (problem_data->sparse_invalidated_by_call);
|
BITMAP_FREE (problem_data->dense_invalidated_by_call);
|
BITMAP_FREE (problem_data->dense_invalidated_by_call);
|
|
|
dflow->block_info_size = 0;
|
dflow->block_info_size = 0;
|
free (dflow->block_info);
|
free (dflow->block_info);
|
free (dflow->problem_data);
|
free (dflow->problem_data);
|
}
|
}
|
free (dflow);
|
free (dflow);
|
}
|
}
|
|
|
|
|
/* Debugging info. */
|
/* Debugging info. */
|
|
|
static void
|
static void
|
df_ru_dump (struct dataflow *dflow, FILE *file)
|
df_ru_dump (struct dataflow *dflow, FILE *file)
|
{
|
{
|
basic_block bb;
|
basic_block bb;
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
struct df_ru_problem_data *problem_data
|
struct df_ru_problem_data *problem_data
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
= (struct df_ru_problem_data *) dflow->problem_data;
|
unsigned int m = max_reg_num ();
|
unsigned int m = max_reg_num ();
|
unsigned int regno;
|
unsigned int regno;
|
|
|
if (!dflow->block_info)
|
if (!dflow->block_info)
|
return;
|
return;
|
|
|
fprintf (file, "Reaching uses:\n");
|
fprintf (file, "Reaching uses:\n");
|
|
|
fprintf (file, " sparse invalidated \t");
|
fprintf (file, " sparse invalidated \t");
|
dump_bitmap (file, problem_data->sparse_invalidated_by_call);
|
dump_bitmap (file, problem_data->sparse_invalidated_by_call);
|
fprintf (file, " dense invalidated \t");
|
fprintf (file, " dense invalidated \t");
|
dump_bitmap (file, problem_data->dense_invalidated_by_call);
|
dump_bitmap (file, problem_data->dense_invalidated_by_call);
|
|
|
for (regno = 0; regno < m; regno++)
|
for (regno = 0; regno < m; regno++)
|
if (DF_REG_USE_GET (df, regno)->n_refs)
|
if (DF_REG_USE_GET (df, regno)->n_refs)
|
fprintf (file, "%d[%d,%d] ", regno,
|
fprintf (file, "%d[%d,%d] ", regno,
|
DF_REG_USE_GET (df, regno)->begin,
|
DF_REG_USE_GET (df, regno)->begin,
|
DF_REG_USE_GET (df, regno)->n_refs);
|
DF_REG_USE_GET (df, regno)->n_refs);
|
fprintf (file, "\n");
|
fprintf (file, "\n");
|
|
|
FOR_ALL_BB (bb)
|
FOR_ALL_BB (bb)
|
{
|
{
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb->index);
|
struct df_ru_bb_info *bb_info = df_ru_get_bb_info (dflow, bb->index);
|
df_print_bb_index (bb, file);
|
df_print_bb_index (bb, file);
|
|
|
if (!bb_info->in)
|
if (!bb_info->in)
|
continue;
|
continue;
|
|
|
fprintf (file, " in \t(%d)\n", (int) bitmap_count_bits (bb_info->in));
|
fprintf (file, " in \t(%d)\n", (int) bitmap_count_bits (bb_info->in));
|
dump_bitmap (file, bb_info->in);
|
dump_bitmap (file, bb_info->in);
|
fprintf (file, " gen \t(%d)\n", (int) bitmap_count_bits (bb_info->gen));
|
fprintf (file, " gen \t(%d)\n", (int) bitmap_count_bits (bb_info->gen));
|
dump_bitmap (file, bb_info->gen);
|
dump_bitmap (file, bb_info->gen);
|
fprintf (file, " kill\t(%d)\n", (int) bitmap_count_bits (bb_info->kill));
|
fprintf (file, " kill\t(%d)\n", (int) bitmap_count_bits (bb_info->kill));
|
dump_bitmap (file, bb_info->kill);
|
dump_bitmap (file, bb_info->kill);
|
fprintf (file, " out \t(%d)\n", (int) bitmap_count_bits (bb_info->out));
|
fprintf (file, " out \t(%d)\n", (int) bitmap_count_bits (bb_info->out));
|
dump_bitmap (file, bb_info->out);
|
dump_bitmap (file, bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
/* All of the information associated with every instance of the problem. */
|
/* All of the information associated with every instance of the problem. */
|
|
|
static struct df_problem problem_RU =
|
static struct df_problem problem_RU =
|
{
|
{
|
DF_RU, /* Problem id. */
|
DF_RU, /* Problem id. */
|
DF_BACKWARD, /* Direction. */
|
DF_BACKWARD, /* Direction. */
|
df_ru_alloc, /* Allocate the problem specific data. */
|
df_ru_alloc, /* Allocate the problem specific data. */
|
NULL, /* Reset global information. */
|
NULL, /* Reset global information. */
|
df_ru_free_bb_info, /* Free basic block info. */
|
df_ru_free_bb_info, /* Free basic block info. */
|
df_ru_local_compute, /* Local compute function. */
|
df_ru_local_compute, /* Local compute function. */
|
df_ru_init_solution, /* Init the solution specific data. */
|
df_ru_init_solution, /* Init the solution specific data. */
|
df_iterative_dataflow, /* Iterative solver. */
|
df_iterative_dataflow, /* Iterative solver. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator 0. */
|
df_ru_confluence_n, /* Confluence operator n. */
|
df_ru_confluence_n, /* Confluence operator n. */
|
df_ru_transfer_function, /* Transfer function. */
|
df_ru_transfer_function, /* Transfer function. */
|
NULL, /* Finalize function. */
|
NULL, /* Finalize function. */
|
df_ru_free, /* Free all of the problem information. */
|
df_ru_free, /* Free all of the problem information. */
|
df_ru_dump, /* Debugging. */
|
df_ru_dump, /* Debugging. */
|
NULL, /* Dependent problem. */
|
NULL, /* Dependent problem. */
|
0 /* Changeable flags. */
|
0 /* Changeable flags. */
|
};
|
};
|
|
|
|
|
|
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
of DF. The returned structure is what is used to get at the
|
of DF. The returned structure is what is used to get at the
|
solution. */
|
solution. */
|
|
|
struct dataflow *
|
struct dataflow *
|
df_ru_add_problem (struct df *df, int flags)
|
df_ru_add_problem (struct df *df, int flags)
|
{
|
{
|
return df_add_problem (df, &problem_RU, flags);
|
return df_add_problem (df, &problem_RU, flags);
|
}
|
}
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
REACHING DEFINITIONS
|
REACHING DEFINITIONS
|
|
|
Find the locations in the function where each definition site for a
|
Find the locations in the function where each definition site for a
|
pseudo reaches. In and out bitvectors are built for each basic
|
pseudo reaches. In and out bitvectors are built for each basic
|
block. The id field in the ref is used to index into these sets.
|
block. The id field in the ref is used to index into these sets.
|
See df.h for details.
|
See df.h for details.
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* See the comment at the top of the Reaching Uses problem for how the
|
/* See the comment at the top of the Reaching Uses problem for how the
|
uses are represented in the kill sets. The same games are played
|
uses are represented in the kill sets. The same games are played
|
here for the defs. */
|
here for the defs. */
|
|
|
/* Private data used to compute the solution for this problem. These
|
/* Private data used to compute the solution for this problem. These
|
data structures are not accessible outside of this module. */
|
data structures are not accessible outside of this module. */
|
struct df_rd_problem_data
|
struct df_rd_problem_data
|
{
|
{
|
/* If the number of defs for regnum N is less than
|
/* If the number of defs for regnum N is less than
|
DF_SPARSE_THRESHOLD, uses_sites[N] contains a mask of the all of
|
DF_SPARSE_THRESHOLD, uses_sites[N] contains a mask of the all of
|
the defs of reg N indexed by the id in the ref structure. If
|
the defs of reg N indexed by the id in the ref structure. If
|
there are more than DF_SPARSE_THRESHOLD defs for regnum N a
|
there are more than DF_SPARSE_THRESHOLD defs for regnum N a
|
different mechanism is used to mask the def. */
|
different mechanism is used to mask the def. */
|
bitmap *def_sites; /* Bitmap of defs for each pseudo. */
|
bitmap *def_sites; /* Bitmap of defs for each pseudo. */
|
unsigned int def_sites_size; /* Size of def_sites. */
|
unsigned int def_sites_size; /* Size of def_sites. */
|
/* The set of defs to regs invalidated by call. */
|
/* The set of defs to regs invalidated by call. */
|
bitmap sparse_invalidated_by_call;
|
bitmap sparse_invalidated_by_call;
|
/* The set of defs to regs invalidate by call for rd. */
|
/* The set of defs to regs invalidate by call for rd. */
|
bitmap dense_invalidated_by_call;
|
bitmap dense_invalidated_by_call;
|
};
|
};
|
|
|
/* Get basic block info. */
|
/* Get basic block info. */
|
|
|
struct df_rd_bb_info *
|
struct df_rd_bb_info *
|
df_rd_get_bb_info (struct dataflow *dflow, unsigned int index)
|
df_rd_get_bb_info (struct dataflow *dflow, unsigned int index)
|
{
|
{
|
return (struct df_rd_bb_info *) dflow->block_info[index];
|
return (struct df_rd_bb_info *) dflow->block_info[index];
|
}
|
}
|
|
|
|
|
/* Set basic block info. */
|
/* Set basic block info. */
|
|
|
static void
|
static void
|
df_rd_set_bb_info (struct dataflow *dflow, unsigned int index,
|
df_rd_set_bb_info (struct dataflow *dflow, unsigned int index,
|
struct df_rd_bb_info *bb_info)
|
struct df_rd_bb_info *bb_info)
|
{
|
{
|
dflow->block_info[index] = bb_info;
|
dflow->block_info[index] = bb_info;
|
}
|
}
|
|
|
|
|
/* Free basic block info. */
|
/* Free basic block info. */
|
|
|
static void
|
static void
|
df_rd_free_bb_info (struct dataflow *dflow,
|
df_rd_free_bb_info (struct dataflow *dflow,
|
basic_block bb ATTRIBUTE_UNUSED,
|
basic_block bb ATTRIBUTE_UNUSED,
|
void *vbb_info)
|
void *vbb_info)
|
{
|
{
|
struct df_rd_bb_info *bb_info = (struct df_rd_bb_info *) vbb_info;
|
struct df_rd_bb_info *bb_info = (struct df_rd_bb_info *) vbb_info;
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
pool_free (dflow->block_pool, bb_info);
|
pool_free (dflow->block_pool, bb_info);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
not touched unless the block is new. */
|
not touched unless the block is new. */
|
|
|
static void
|
static void
|
df_rd_alloc (struct dataflow *dflow,
|
df_rd_alloc (struct dataflow *dflow,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap all_blocks)
|
bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int reg_size = max_reg_num ();
|
unsigned int reg_size = max_reg_num ();
|
|
|
if (!dflow->block_pool)
|
if (!dflow->block_pool)
|
dflow->block_pool = create_alloc_pool ("df_rd_block pool",
|
dflow->block_pool = create_alloc_pool ("df_rd_block pool",
|
sizeof (struct df_rd_bb_info), 50);
|
sizeof (struct df_rd_bb_info), 50);
|
|
|
if (dflow->problem_data)
|
if (dflow->problem_data)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
struct df_rd_problem_data *problem_data
|
struct df_rd_problem_data *problem_data
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
|
|
for (i = 0; i < problem_data->def_sites_size; i++)
|
for (i = 0; i < problem_data->def_sites_size; i++)
|
{
|
{
|
bitmap bm = problem_data->def_sites[i];
|
bitmap bm = problem_data->def_sites[i];
|
if (bm)
|
if (bm)
|
{
|
{
|
BITMAP_FREE (bm);
|
BITMAP_FREE (bm);
|
problem_data->def_sites[i] = NULL;
|
problem_data->def_sites[i] = NULL;
|
}
|
}
|
}
|
}
|
|
|
if (problem_data->def_sites_size < reg_size)
|
if (problem_data->def_sites_size < reg_size)
|
{
|
{
|
problem_data->def_sites
|
problem_data->def_sites
|
= xrealloc (problem_data->def_sites, reg_size *sizeof (bitmap));
|
= xrealloc (problem_data->def_sites, reg_size *sizeof (bitmap));
|
memset (problem_data->def_sites + problem_data->def_sites_size, 0,
|
memset (problem_data->def_sites + problem_data->def_sites_size, 0,
|
(reg_size - problem_data->def_sites_size) *sizeof (bitmap));
|
(reg_size - problem_data->def_sites_size) *sizeof (bitmap));
|
problem_data->def_sites_size = reg_size;
|
problem_data->def_sites_size = reg_size;
|
}
|
}
|
|
|
bitmap_clear (problem_data->sparse_invalidated_by_call);
|
bitmap_clear (problem_data->sparse_invalidated_by_call);
|
bitmap_clear (problem_data->dense_invalidated_by_call);
|
bitmap_clear (problem_data->dense_invalidated_by_call);
|
}
|
}
|
else
|
else
|
{
|
{
|
struct df_rd_problem_data *problem_data = XNEW (struct df_rd_problem_data);
|
struct df_rd_problem_data *problem_data = XNEW (struct df_rd_problem_data);
|
dflow->problem_data = problem_data;
|
dflow->problem_data = problem_data;
|
|
|
problem_data->def_sites = XCNEWVEC (bitmap, reg_size);
|
problem_data->def_sites = XCNEWVEC (bitmap, reg_size);
|
problem_data->def_sites_size = reg_size;
|
problem_data->def_sites_size = reg_size;
|
problem_data->sparse_invalidated_by_call = BITMAP_ALLOC (NULL);
|
problem_data->sparse_invalidated_by_call = BITMAP_ALLOC (NULL);
|
problem_data->dense_invalidated_by_call = BITMAP_ALLOC (NULL);
|
problem_data->dense_invalidated_by_call = BITMAP_ALLOC (NULL);
|
}
|
}
|
|
|
df_grow_bb_info (dflow);
|
df_grow_bb_info (dflow);
|
|
|
/* Because of the clustering of all use sites for the same pseudo,
|
/* Because of the clustering of all use sites for the same pseudo,
|
we have to process all of the blocks before doing the
|
we have to process all of the blocks before doing the
|
analysis. */
|
analysis. */
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->sparse_kill);
|
bitmap_clear (bb_info->sparse_kill);
|
bitmap_clear (bb_info->gen);
|
bitmap_clear (bb_info->gen);
|
}
|
}
|
else
|
else
|
{
|
{
|
bb_info = (struct df_rd_bb_info *) pool_alloc (dflow->block_pool);
|
bb_info = (struct df_rd_bb_info *) pool_alloc (dflow->block_pool);
|
df_rd_set_bb_info (dflow, bb_index, bb_info);
|
df_rd_set_bb_info (dflow, bb_index, bb_info);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->sparse_kill = BITMAP_ALLOC (NULL);
|
bb_info->sparse_kill = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Process a list of DEFs for df_rd_bb_local_compute. */
|
/* Process a list of DEFs for df_rd_bb_local_compute. */
|
|
|
static void
|
static void
|
df_rd_bb_local_compute_process_def (struct dataflow *dflow,
|
df_rd_bb_local_compute_process_def (struct dataflow *dflow,
|
struct df_rd_bb_info *bb_info,
|
struct df_rd_bb_info *bb_info,
|
struct df_ref *def,
|
struct df_ref *def,
|
enum df_ref_flags top_flag)
|
enum df_ref_flags top_flag)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
while (def)
|
while (def)
|
{
|
{
|
if (top_flag == (DF_REF_FLAGS (def) & DF_REF_AT_TOP))
|
if (top_flag == (DF_REF_FLAGS (def) & DF_REF_AT_TOP))
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int begin = DF_REG_DEF_GET (df, regno)->begin;
|
unsigned int begin = DF_REG_DEF_GET (df, regno)->begin;
|
unsigned int n_defs = DF_REG_DEF_GET (df, regno)->n_refs;
|
unsigned int n_defs = DF_REG_DEF_GET (df, regno)->n_refs;
|
|
|
/* Only the last def(s) for a regno in the block has any
|
/* Only the last def(s) for a regno in the block has any
|
effect. */
|
effect. */
|
if (!bitmap_bit_p (seen_in_block, regno))
|
if (!bitmap_bit_p (seen_in_block, regno))
|
{
|
{
|
/* The first def for regno in insn gets to knock out the
|
/* The first def for regno in insn gets to knock out the
|
defs from other instructions. */
|
defs from other instructions. */
|
if ((!bitmap_bit_p (seen_in_insn, regno))
|
if ((!bitmap_bit_p (seen_in_insn, regno))
|
/* If the def is to only part of the reg, it does
|
/* If the def is to only part of the reg, it does
|
not kill the other defs that reach here. */
|
not kill the other defs that reach here. */
|
&& (!((DF_REF_FLAGS (def) & DF_REF_PARTIAL)
|
&& (!((DF_REF_FLAGS (def) & DF_REF_PARTIAL)
|
|| (DF_REF_FLAGS (def) & DF_REF_MAY_CLOBBER))))
|
|| (DF_REF_FLAGS (def) & DF_REF_MAY_CLOBBER))))
|
{
|
{
|
if (n_defs > DF_SPARSE_THRESHOLD)
|
if (n_defs > DF_SPARSE_THRESHOLD)
|
{
|
{
|
bitmap_set_bit (bb_info->sparse_kill, regno);
|
bitmap_set_bit (bb_info->sparse_kill, regno);
|
bitmap_clear_range(bb_info->gen, begin, n_defs);
|
bitmap_clear_range(bb_info->gen, begin, n_defs);
|
}
|
}
|
else
|
else
|
{
|
{
|
struct df_rd_problem_data * problem_data
|
struct df_rd_problem_data * problem_data
|
= (struct df_rd_problem_data *)dflow->problem_data;
|
= (struct df_rd_problem_data *)dflow->problem_data;
|
bitmap defs = df_ref_bitmap (problem_data->def_sites,
|
bitmap defs = df_ref_bitmap (problem_data->def_sites,
|
regno, begin, n_defs);
|
regno, begin, n_defs);
|
bitmap_ior_into (bb_info->kill, defs);
|
bitmap_ior_into (bb_info->kill, defs);
|
bitmap_and_compl_into (bb_info->gen, defs);
|
bitmap_and_compl_into (bb_info->gen, defs);
|
}
|
}
|
}
|
}
|
|
|
bitmap_set_bit (seen_in_insn, regno);
|
bitmap_set_bit (seen_in_insn, regno);
|
/* All defs for regno in the instruction may be put into
|
/* All defs for regno in the instruction may be put into
|
the gen set. */
|
the gen set. */
|
if (!(DF_REF_FLAGS (def)
|
if (!(DF_REF_FLAGS (def)
|
& (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER)))
|
& (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER)))
|
bitmap_set_bit (bb_info->gen, DF_REF_ID (def));
|
bitmap_set_bit (bb_info->gen, DF_REF_ID (def));
|
}
|
}
|
}
|
}
|
def = def->next_ref;
|
def = def->next_ref;
|
}
|
}
|
}
|
}
|
|
|
/* Compute local reaching def info for basic block BB. */
|
/* Compute local reaching def info for basic block BB. */
|
|
|
static void
|
static void
|
df_rd_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
df_rd_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
rtx insn;
|
rtx insn;
|
|
|
bitmap_clear (seen_in_block);
|
bitmap_clear (seen_in_block);
|
bitmap_clear (seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
|
|
df_rd_bb_local_compute_process_def (dflow, bb_info,
|
df_rd_bb_local_compute_process_def (dflow, bb_info,
|
df_get_artificial_defs (df, bb_index), 0);
|
df_get_artificial_defs (df, bb_index), 0);
|
|
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
{
|
{
|
unsigned int uid = INSN_UID (insn);
|
unsigned int uid = INSN_UID (insn);
|
|
|
if (!INSN_P (insn))
|
if (!INSN_P (insn))
|
continue;
|
continue;
|
|
|
df_rd_bb_local_compute_process_def (dflow, bb_info,
|
df_rd_bb_local_compute_process_def (dflow, bb_info,
|
DF_INSN_UID_DEFS (df, uid), 0);
|
DF_INSN_UID_DEFS (df, uid), 0);
|
|
|
/* This complex dance with the two bitmaps is required because
|
/* This complex dance with the two bitmaps is required because
|
instructions can assign twice to the same pseudo. This
|
instructions can assign twice to the same pseudo. This
|
generally happens with calls that will have one def for the
|
generally happens with calls that will have one def for the
|
result and another def for the clobber. If only one vector
|
result and another def for the clobber. If only one vector
|
is used and the clobber goes first, the result will be
|
is used and the clobber goes first, the result will be
|
lost. */
|
lost. */
|
bitmap_ior_into (seen_in_block, seen_in_insn);
|
bitmap_ior_into (seen_in_block, seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
}
|
}
|
|
|
/* Process the artificial defs at the top of the block last since we
|
/* Process the artificial defs at the top of the block last since we
|
are going backwards through the block and these are logically at
|
are going backwards through the block and these are logically at
|
the start. */
|
the start. */
|
df_rd_bb_local_compute_process_def (dflow, bb_info,
|
df_rd_bb_local_compute_process_def (dflow, bb_info,
|
df_get_artificial_defs (df, bb_index),
|
df_get_artificial_defs (df, bb_index),
|
DF_REF_AT_TOP);
|
DF_REF_AT_TOP);
|
}
|
}
|
|
|
|
|
/* Compute local reaching def info for each basic block within BLOCKS. */
|
/* Compute local reaching def info for each basic block within BLOCKS. */
|
|
|
static void
|
static void
|
df_rd_local_compute (struct dataflow *dflow,
|
df_rd_local_compute (struct dataflow *dflow,
|
bitmap all_blocks,
|
bitmap all_blocks,
|
bitmap rescan_blocks ATTRIBUTE_UNUSED)
|
bitmap rescan_blocks ATTRIBUTE_UNUSED)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
struct df_rd_problem_data *problem_data
|
struct df_rd_problem_data *problem_data
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
|
|
df_set_seen ();
|
df_set_seen ();
|
|
|
if (!df->def_info.refs_organized)
|
if (!df->def_info.refs_organized)
|
df_reorganize_refs (&df->def_info);
|
df_reorganize_refs (&df->def_info);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
df_rd_bb_local_compute (dflow, bb_index);
|
df_rd_bb_local_compute (dflow, bb_index);
|
}
|
}
|
|
|
/* Set up the knockout bit vectors to be applied across EH_EDGES. */
|
/* Set up the knockout bit vectors to be applied across EH_EDGES. */
|
EXECUTE_IF_SET_IN_BITMAP (df_invalidated_by_call, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (df_invalidated_by_call, 0, regno, bi)
|
{
|
{
|
struct df_reg_info *reg_info = DF_REG_DEF_GET (df, regno);
|
struct df_reg_info *reg_info = DF_REG_DEF_GET (df, regno);
|
if (reg_info->n_refs > DF_SPARSE_THRESHOLD)
|
if (reg_info->n_refs > DF_SPARSE_THRESHOLD)
|
{
|
{
|
bitmap_set_bit (sparse_invalidated, regno);
|
bitmap_set_bit (sparse_invalidated, regno);
|
}
|
}
|
else
|
else
|
{
|
{
|
bitmap defs = df_ref_bitmap (problem_data->def_sites, regno,
|
bitmap defs = df_ref_bitmap (problem_data->def_sites, regno,
|
reg_info->begin, reg_info->n_refs);
|
reg_info->begin, reg_info->n_refs);
|
bitmap_ior_into (dense_invalidated, defs);
|
bitmap_ior_into (dense_invalidated, defs);
|
}
|
}
|
}
|
}
|
df_unset_seen ();
|
df_unset_seen ();
|
}
|
}
|
|
|
|
|
/* Initialize the solution bit vectors for problem. */
|
/* Initialize the solution bit vectors for problem. */
|
|
|
static void
|
static void
|
df_rd_init_solution (struct dataflow *dflow, bitmap all_blocks)
|
df_rd_init_solution (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
|
|
bitmap_copy (bb_info->out, bb_info->gen);
|
bitmap_copy (bb_info->out, bb_info->gen);
|
bitmap_clear (bb_info->in);
|
bitmap_clear (bb_info->in);
|
}
|
}
|
}
|
}
|
|
|
/* In of target gets or of out of source. */
|
/* In of target gets or of out of source. */
|
|
|
static void
|
static void
|
df_rd_confluence_n (struct dataflow *dflow, edge e)
|
df_rd_confluence_n (struct dataflow *dflow, edge e)
|
{
|
{
|
bitmap op1 = df_rd_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op1 = df_rd_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op2 = df_rd_get_bb_info (dflow, e->src->index)->out;
|
bitmap op2 = df_rd_get_bb_info (dflow, e->src->index)->out;
|
|
|
if (e->flags & EDGE_EH)
|
if (e->flags & EDGE_EH)
|
{
|
{
|
struct df_rd_problem_data *problem_data
|
struct df_rd_problem_data *problem_data
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap sparse_invalidated = problem_data->sparse_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
bitmap dense_invalidated = problem_data->dense_invalidated_by_call;
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
|
|
bitmap_copy (tmp, op2);
|
bitmap_copy (tmp, op2);
|
bitmap_and_compl_into (tmp, dense_invalidated);
|
bitmap_and_compl_into (tmp, dense_invalidated);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (sparse_invalidated, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (sparse_invalidated, 0, regno, bi)
|
{
|
{
|
bitmap_clear_range (tmp,
|
bitmap_clear_range (tmp,
|
DF_REG_DEF_GET (df, regno)->begin,
|
DF_REG_DEF_GET (df, regno)->begin,
|
DF_REG_DEF_GET (df, regno)->n_refs);
|
DF_REG_DEF_GET (df, regno)->n_refs);
|
}
|
}
|
bitmap_ior_into (op1, tmp);
|
bitmap_ior_into (op1, tmp);
|
BITMAP_FREE (tmp);
|
BITMAP_FREE (tmp);
|
}
|
}
|
else
|
else
|
bitmap_ior_into (op1, op2);
|
bitmap_ior_into (op1, op2);
|
}
|
}
|
|
|
|
|
/* Transfer function. */
|
/* Transfer function. */
|
|
|
static bool
|
static bool
|
df_rd_transfer_function (struct dataflow *dflow, int bb_index)
|
df_rd_transfer_function (struct dataflow *dflow, int bb_index)
|
{
|
{
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb_index);
|
unsigned int regno;
|
unsigned int regno;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
bitmap in = bb_info->in;
|
bitmap in = bb_info->in;
|
bitmap out = bb_info->out;
|
bitmap out = bb_info->out;
|
bitmap gen = bb_info->gen;
|
bitmap gen = bb_info->gen;
|
bitmap kill = bb_info->kill;
|
bitmap kill = bb_info->kill;
|
bitmap sparse_kill = bb_info->sparse_kill;
|
bitmap sparse_kill = bb_info->sparse_kill;
|
|
|
if (bitmap_empty_p (sparse_kill))
|
if (bitmap_empty_p (sparse_kill))
|
return bitmap_ior_and_compl (out, gen, in, kill);
|
return bitmap_ior_and_compl (out, gen, in, kill);
|
else
|
else
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
bool changed = false;
|
bool changed = false;
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap_copy (tmp, in);
|
bitmap_copy (tmp, in);
|
EXECUTE_IF_SET_IN_BITMAP (sparse_kill, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (sparse_kill, 0, regno, bi)
|
{
|
{
|
bitmap_clear_range (tmp,
|
bitmap_clear_range (tmp,
|
DF_REG_DEF_GET (df, regno)->begin,
|
DF_REG_DEF_GET (df, regno)->begin,
|
DF_REG_DEF_GET (df, regno)->n_refs);
|
DF_REG_DEF_GET (df, regno)->n_refs);
|
}
|
}
|
bitmap_and_compl_into (tmp, kill);
|
bitmap_and_compl_into (tmp, kill);
|
bitmap_ior_into (tmp, gen);
|
bitmap_ior_into (tmp, gen);
|
changed = !bitmap_equal_p (tmp, out);
|
changed = !bitmap_equal_p (tmp, out);
|
if (changed)
|
if (changed)
|
{
|
{
|
BITMAP_FREE (out);
|
BITMAP_FREE (out);
|
bb_info->out = tmp;
|
bb_info->out = tmp;
|
}
|
}
|
else
|
else
|
BITMAP_FREE (tmp);
|
BITMAP_FREE (tmp);
|
return changed;
|
return changed;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Free all storage associated with the problem. */
|
/* Free all storage associated with the problem. */
|
|
|
static void
|
static void
|
df_rd_free (struct dataflow *dflow)
|
df_rd_free (struct dataflow *dflow)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
struct df_rd_problem_data *problem_data
|
struct df_rd_problem_data *problem_data
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
|
|
if (problem_data)
|
if (problem_data)
|
{
|
{
|
for (i = 0; i < dflow->block_info_size; i++)
|
for (i = 0; i < dflow->block_info_size; i++)
|
{
|
{
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, i);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, i);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->sparse_kill);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
|
|
for (i = 0; i < problem_data->def_sites_size; i++)
|
for (i = 0; i < problem_data->def_sites_size; i++)
|
{
|
{
|
bitmap bm = problem_data->def_sites[i];
|
bitmap bm = problem_data->def_sites[i];
|
if (bm)
|
if (bm)
|
BITMAP_FREE (bm);
|
BITMAP_FREE (bm);
|
}
|
}
|
|
|
free (problem_data->def_sites);
|
free (problem_data->def_sites);
|
BITMAP_FREE (problem_data->sparse_invalidated_by_call);
|
BITMAP_FREE (problem_data->sparse_invalidated_by_call);
|
BITMAP_FREE (problem_data->dense_invalidated_by_call);
|
BITMAP_FREE (problem_data->dense_invalidated_by_call);
|
|
|
dflow->block_info_size = 0;
|
dflow->block_info_size = 0;
|
free (dflow->block_info);
|
free (dflow->block_info);
|
free (dflow->problem_data);
|
free (dflow->problem_data);
|
}
|
}
|
free (dflow);
|
free (dflow);
|
}
|
}
|
|
|
|
|
/* Debugging info. */
|
/* Debugging info. */
|
|
|
static void
|
static void
|
df_rd_dump (struct dataflow *dflow, FILE *file)
|
df_rd_dump (struct dataflow *dflow, FILE *file)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
basic_block bb;
|
basic_block bb;
|
struct df_rd_problem_data *problem_data
|
struct df_rd_problem_data *problem_data
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
= (struct df_rd_problem_data *) dflow->problem_data;
|
unsigned int m = max_reg_num ();
|
unsigned int m = max_reg_num ();
|
unsigned int regno;
|
unsigned int regno;
|
|
|
if (!dflow->block_info)
|
if (!dflow->block_info)
|
return;
|
return;
|
|
|
fprintf (file, "Reaching defs:\n\n");
|
fprintf (file, "Reaching defs:\n\n");
|
|
|
fprintf (file, " sparse invalidated \t");
|
fprintf (file, " sparse invalidated \t");
|
dump_bitmap (file, problem_data->sparse_invalidated_by_call);
|
dump_bitmap (file, problem_data->sparse_invalidated_by_call);
|
fprintf (file, " dense invalidated \t");
|
fprintf (file, " dense invalidated \t");
|
dump_bitmap (file, problem_data->dense_invalidated_by_call);
|
dump_bitmap (file, problem_data->dense_invalidated_by_call);
|
|
|
for (regno = 0; regno < m; regno++)
|
for (regno = 0; regno < m; regno++)
|
if (DF_REG_DEF_GET (df, regno)->n_refs)
|
if (DF_REG_DEF_GET (df, regno)->n_refs)
|
fprintf (file, "%d[%d,%d] ", regno,
|
fprintf (file, "%d[%d,%d] ", regno,
|
DF_REG_DEF_GET (df, regno)->begin,
|
DF_REG_DEF_GET (df, regno)->begin,
|
DF_REG_DEF_GET (df, regno)->n_refs);
|
DF_REG_DEF_GET (df, regno)->n_refs);
|
fprintf (file, "\n");
|
fprintf (file, "\n");
|
|
|
FOR_ALL_BB (bb)
|
FOR_ALL_BB (bb)
|
{
|
{
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb->index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (dflow, bb->index);
|
df_print_bb_index (bb, file);
|
df_print_bb_index (bb, file);
|
|
|
if (!bb_info->in)
|
if (!bb_info->in)
|
continue;
|
continue;
|
|
|
fprintf (file, " in \t(%d)\n", (int) bitmap_count_bits (bb_info->in));
|
fprintf (file, " in \t(%d)\n", (int) bitmap_count_bits (bb_info->in));
|
dump_bitmap (file, bb_info->in);
|
dump_bitmap (file, bb_info->in);
|
fprintf (file, " gen \t(%d)\n", (int) bitmap_count_bits (bb_info->gen));
|
fprintf (file, " gen \t(%d)\n", (int) bitmap_count_bits (bb_info->gen));
|
dump_bitmap (file, bb_info->gen);
|
dump_bitmap (file, bb_info->gen);
|
fprintf (file, " kill\t(%d)\n", (int) bitmap_count_bits (bb_info->kill));
|
fprintf (file, " kill\t(%d)\n", (int) bitmap_count_bits (bb_info->kill));
|
dump_bitmap (file, bb_info->kill);
|
dump_bitmap (file, bb_info->kill);
|
fprintf (file, " out \t(%d)\n", (int) bitmap_count_bits (bb_info->out));
|
fprintf (file, " out \t(%d)\n", (int) bitmap_count_bits (bb_info->out));
|
dump_bitmap (file, bb_info->out);
|
dump_bitmap (file, bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
/* All of the information associated with every instance of the problem. */
|
/* All of the information associated with every instance of the problem. */
|
|
|
static struct df_problem problem_RD =
|
static struct df_problem problem_RD =
|
{
|
{
|
DF_RD, /* Problem id. */
|
DF_RD, /* Problem id. */
|
DF_FORWARD, /* Direction. */
|
DF_FORWARD, /* Direction. */
|
df_rd_alloc, /* Allocate the problem specific data. */
|
df_rd_alloc, /* Allocate the problem specific data. */
|
NULL, /* Reset global information. */
|
NULL, /* Reset global information. */
|
df_rd_free_bb_info, /* Free basic block info. */
|
df_rd_free_bb_info, /* Free basic block info. */
|
df_rd_local_compute, /* Local compute function. */
|
df_rd_local_compute, /* Local compute function. */
|
df_rd_init_solution, /* Init the solution specific data. */
|
df_rd_init_solution, /* Init the solution specific data. */
|
df_iterative_dataflow, /* Iterative solver. */
|
df_iterative_dataflow, /* Iterative solver. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator 0. */
|
df_rd_confluence_n, /* Confluence operator n. */
|
df_rd_confluence_n, /* Confluence operator n. */
|
df_rd_transfer_function, /* Transfer function. */
|
df_rd_transfer_function, /* Transfer function. */
|
NULL, /* Finalize function. */
|
NULL, /* Finalize function. */
|
df_rd_free, /* Free all of the problem information. */
|
df_rd_free, /* Free all of the problem information. */
|
df_rd_dump, /* Debugging. */
|
df_rd_dump, /* Debugging. */
|
NULL, /* Dependent problem. */
|
NULL, /* Dependent problem. */
|
0 /* Changeable flags. */
|
0 /* Changeable flags. */
|
};
|
};
|
|
|
|
|
|
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
of DF. The returned structure is what is used to get at the
|
of DF. The returned structure is what is used to get at the
|
solution. */
|
solution. */
|
|
|
struct dataflow *
|
struct dataflow *
|
df_rd_add_problem (struct df *df, int flags)
|
df_rd_add_problem (struct df *df, int flags)
|
{
|
{
|
return df_add_problem (df, &problem_RD, flags);
|
return df_add_problem (df, &problem_RD, flags);
|
}
|
}
|
|
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
LIVE REGISTERS
|
LIVE REGISTERS
|
|
|
Find the locations in the function where any use of a pseudo can
|
Find the locations in the function where any use of a pseudo can
|
reach in the backwards direction. In and out bitvectors are built
|
reach in the backwards direction. In and out bitvectors are built
|
for each basic block. The regnum is used to index into these sets.
|
for each basic block. The regnum is used to index into these sets.
|
See df.h for details.
|
See df.h for details.
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* Get basic block info. */
|
/* Get basic block info. */
|
|
|
struct df_lr_bb_info *
|
struct df_lr_bb_info *
|
df_lr_get_bb_info (struct dataflow *dflow, unsigned int index)
|
df_lr_get_bb_info (struct dataflow *dflow, unsigned int index)
|
{
|
{
|
return (struct df_lr_bb_info *) dflow->block_info[index];
|
return (struct df_lr_bb_info *) dflow->block_info[index];
|
}
|
}
|
|
|
|
|
/* Set basic block info. */
|
/* Set basic block info. */
|
|
|
static void
|
static void
|
df_lr_set_bb_info (struct dataflow *dflow, unsigned int index,
|
df_lr_set_bb_info (struct dataflow *dflow, unsigned int index,
|
struct df_lr_bb_info *bb_info)
|
struct df_lr_bb_info *bb_info)
|
{
|
{
|
dflow->block_info[index] = bb_info;
|
dflow->block_info[index] = bb_info;
|
}
|
}
|
|
|
|
|
/* Free basic block info. */
|
/* Free basic block info. */
|
|
|
static void
|
static void
|
df_lr_free_bb_info (struct dataflow *dflow,
|
df_lr_free_bb_info (struct dataflow *dflow,
|
basic_block bb ATTRIBUTE_UNUSED,
|
basic_block bb ATTRIBUTE_UNUSED,
|
void *vbb_info)
|
void *vbb_info)
|
{
|
{
|
struct df_lr_bb_info *bb_info = (struct df_lr_bb_info *) vbb_info;
|
struct df_lr_bb_info *bb_info = (struct df_lr_bb_info *) vbb_info;
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->use);
|
BITMAP_FREE (bb_info->use);
|
BITMAP_FREE (bb_info->def);
|
BITMAP_FREE (bb_info->def);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
pool_free (dflow->block_pool, bb_info);
|
pool_free (dflow->block_pool, bb_info);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
not touched unless the block is new. */
|
not touched unless the block is new. */
|
|
|
static void
|
static void
|
df_lr_alloc (struct dataflow *dflow, bitmap blocks_to_rescan,
|
df_lr_alloc (struct dataflow *dflow, bitmap blocks_to_rescan,
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
if (!dflow->block_pool)
|
if (!dflow->block_pool)
|
dflow->block_pool = create_alloc_pool ("df_lr_block pool",
|
dflow->block_pool = create_alloc_pool ("df_lr_block pool",
|
sizeof (struct df_lr_bb_info), 50);
|
sizeof (struct df_lr_bb_info), 50);
|
|
|
df_grow_bb_info (dflow);
|
df_grow_bb_info (dflow);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_rescan, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_rescan, 0, bb_index, bi)
|
{
|
{
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
bitmap_clear (bb_info->def);
|
bitmap_clear (bb_info->def);
|
bitmap_clear (bb_info->use);
|
bitmap_clear (bb_info->use);
|
}
|
}
|
else
|
else
|
{
|
{
|
bb_info = (struct df_lr_bb_info *) pool_alloc (dflow->block_pool);
|
bb_info = (struct df_lr_bb_info *) pool_alloc (dflow->block_pool);
|
df_lr_set_bb_info (dflow, bb_index, bb_info);
|
df_lr_set_bb_info (dflow, bb_index, bb_info);
|
bb_info->use = BITMAP_ALLOC (NULL);
|
bb_info->use = BITMAP_ALLOC (NULL);
|
bb_info->def = BITMAP_ALLOC (NULL);
|
bb_info->def = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Compute local live register info for basic block BB. */
|
/* Compute local live register info for basic block BB. */
|
|
|
static void
|
static void
|
df_lr_bb_local_compute (struct dataflow *dflow,
|
df_lr_bb_local_compute (struct dataflow *dflow,
|
struct df *df, unsigned int bb_index)
|
struct df *df, unsigned int bb_index)
|
{
|
{
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
rtx insn;
|
rtx insn;
|
struct df_ref *def;
|
struct df_ref *def;
|
struct df_ref *use;
|
struct df_ref *use;
|
|
|
/* Process the registers set in an exception handler. */
|
/* Process the registers set in an exception handler. */
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if (((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
if (((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
&& (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL)))
|
&& (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL)))
|
{
|
{
|
unsigned int dregno = DF_REF_REGNO (def);
|
unsigned int dregno = DF_REF_REGNO (def);
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
}
|
}
|
|
|
/* Process the hardware registers that are always live. */
|
/* Process the hardware registers that are always live. */
|
for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
|
for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
|
/* Add use to set of uses in this BB. */
|
/* Add use to set of uses in this BB. */
|
if ((DF_REF_FLAGS (use) & DF_REF_AT_TOP) == 0)
|
if ((DF_REF_FLAGS (use) & DF_REF_AT_TOP) == 0)
|
bitmap_set_bit (bb_info->use, DF_REF_REGNO (use));
|
bitmap_set_bit (bb_info->use, DF_REF_REGNO (use));
|
|
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
{
|
{
|
unsigned int uid = INSN_UID (insn);
|
unsigned int uid = INSN_UID (insn);
|
|
|
if (!INSN_P (insn))
|
if (!INSN_P (insn))
|
continue;
|
continue;
|
|
|
if (CALL_P (insn))
|
if (CALL_P (insn))
|
{
|
{
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
{
|
{
|
unsigned int dregno = DF_REF_REGNO (def);
|
unsigned int dregno = DF_REF_REGNO (def);
|
|
|
if (dregno >= FIRST_PSEUDO_REGISTER
|
if (dregno >= FIRST_PSEUDO_REGISTER
|
|| !(SIBLING_CALL_P (insn)
|
|| !(SIBLING_CALL_P (insn)
|
&& bitmap_bit_p (df->exit_block_uses, dregno)
|
&& bitmap_bit_p (df->exit_block_uses, dregno)
|
&& !refers_to_regno_p (dregno, dregno+1,
|
&& !refers_to_regno_p (dregno, dregno+1,
|
current_function_return_rtx,
|
current_function_return_rtx,
|
(rtx *)0)))
|
(rtx *)0)))
|
{
|
{
|
/* If the def is to only part of the reg, it does
|
/* If the def is to only part of the reg, it does
|
not kill the other defs that reach here. */
|
not kill the other defs that reach here. */
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
{
|
{
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
{
|
{
|
unsigned int dregno = DF_REF_REGNO (def);
|
unsigned int dregno = DF_REF_REGNO (def);
|
|
|
if (DF_INSN_CONTAINS_ASM (df, insn)
|
if (DF_INSN_CONTAINS_ASM (df, insn)
|
&& dregno < FIRST_PSEUDO_REGISTER)
|
&& dregno < FIRST_PSEUDO_REGISTER)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
unsigned int end = dregno
|
unsigned int end = dregno
|
+ hard_regno_nregs[dregno][GET_MODE (DF_REF_REG (def))] - 1;
|
+ hard_regno_nregs[dregno][GET_MODE (DF_REF_REG (def))] - 1;
|
for (i = dregno; i <= end; ++i)
|
for (i = dregno; i <= end; ++i)
|
regs_asm_clobbered[i] = 1;
|
regs_asm_clobbered[i] = 1;
|
}
|
}
|
/* If the def is to only part of the reg, it does
|
/* If the def is to only part of the reg, it does
|
not kill the other defs that reach here. */
|
not kill the other defs that reach here. */
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
{
|
{
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
for (use = DF_INSN_UID_USES (df, uid); use; use = use->next_ref)
|
for (use = DF_INSN_UID_USES (df, uid); use; use = use->next_ref)
|
/* Add use to set of uses in this BB. */
|
/* Add use to set of uses in this BB. */
|
bitmap_set_bit (bb_info->use, DF_REF_REGNO (use));
|
bitmap_set_bit (bb_info->use, DF_REF_REGNO (use));
|
}
|
}
|
|
|
/* Process the registers set in an exception handler. */
|
/* Process the registers set in an exception handler. */
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
&& (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL)))
|
&& (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL)))
|
{
|
{
|
unsigned int dregno = DF_REF_REGNO (def);
|
unsigned int dregno = DF_REF_REGNO (def);
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_set_bit (bb_info->def, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
bitmap_clear_bit (bb_info->use, dregno);
|
}
|
}
|
|
|
#ifdef EH_USES
|
#ifdef EH_USES
|
/* Process the uses that are live into an exception handler. */
|
/* Process the uses that are live into an exception handler. */
|
for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
|
for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
|
/* Add use to set of uses in this BB. */
|
/* Add use to set of uses in this BB. */
|
if (DF_REF_FLAGS (use) & DF_REF_AT_TOP)
|
if (DF_REF_FLAGS (use) & DF_REF_AT_TOP)
|
bitmap_set_bit (bb_info->use, DF_REF_REGNO (use));
|
bitmap_set_bit (bb_info->use, DF_REF_REGNO (use));
|
#endif
|
#endif
|
}
|
}
|
|
|
|
|
/* Compute local live register info for each basic block within BLOCKS. */
|
/* Compute local live register info for each basic block within BLOCKS. */
|
|
|
static void
|
static void
|
df_lr_local_compute (struct dataflow *dflow,
|
df_lr_local_compute (struct dataflow *dflow,
|
bitmap all_blocks,
|
bitmap all_blocks,
|
bitmap rescan_blocks)
|
bitmap rescan_blocks)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
/* Assume that the stack pointer is unchanging if alloca hasn't
|
/* Assume that the stack pointer is unchanging if alloca hasn't
|
been used. */
|
been used. */
|
if (bitmap_equal_p (all_blocks, rescan_blocks))
|
if (bitmap_equal_p (all_blocks, rescan_blocks))
|
memset (regs_asm_clobbered, 0, sizeof (regs_asm_clobbered));
|
memset (regs_asm_clobbered, 0, sizeof (regs_asm_clobbered));
|
|
|
bitmap_clear (df->hardware_regs_used);
|
bitmap_clear (df->hardware_regs_used);
|
|
|
/* The all-important stack pointer must always be live. */
|
/* The all-important stack pointer must always be live. */
|
bitmap_set_bit (df->hardware_regs_used, STACK_POINTER_REGNUM);
|
bitmap_set_bit (df->hardware_regs_used, STACK_POINTER_REGNUM);
|
|
|
/* Before reload, there are a few registers that must be forced
|
/* Before reload, there are a few registers that must be forced
|
live everywhere -- which might not already be the case for
|
live everywhere -- which might not already be the case for
|
blocks within infinite loops. */
|
blocks within infinite loops. */
|
if (!reload_completed)
|
if (!reload_completed)
|
{
|
{
|
/* Any reference to any pseudo before reload is a potential
|
/* Any reference to any pseudo before reload is a potential
|
reference of the frame pointer. */
|
reference of the frame pointer. */
|
bitmap_set_bit (df->hardware_regs_used, FRAME_POINTER_REGNUM);
|
bitmap_set_bit (df->hardware_regs_used, FRAME_POINTER_REGNUM);
|
|
|
#if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
|
#if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
|
/* Pseudos with argument area equivalences may require
|
/* Pseudos with argument area equivalences may require
|
reloading via the argument pointer. */
|
reloading via the argument pointer. */
|
if (fixed_regs[ARG_POINTER_REGNUM])
|
if (fixed_regs[ARG_POINTER_REGNUM])
|
bitmap_set_bit (df->hardware_regs_used, ARG_POINTER_REGNUM);
|
bitmap_set_bit (df->hardware_regs_used, ARG_POINTER_REGNUM);
|
#endif
|
#endif
|
|
|
/* Any constant, or pseudo with constant equivalences, may
|
/* Any constant, or pseudo with constant equivalences, may
|
require reloading from memory using the pic register. */
|
require reloading from memory using the pic register. */
|
if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM
|
if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM
|
&& fixed_regs[PIC_OFFSET_TABLE_REGNUM])
|
&& fixed_regs[PIC_OFFSET_TABLE_REGNUM])
|
bitmap_set_bit (df->hardware_regs_used, PIC_OFFSET_TABLE_REGNUM);
|
bitmap_set_bit (df->hardware_regs_used, PIC_OFFSET_TABLE_REGNUM);
|
}
|
}
|
|
|
if (bitmap_bit_p (rescan_blocks, EXIT_BLOCK))
|
if (bitmap_bit_p (rescan_blocks, EXIT_BLOCK))
|
{
|
{
|
/* The exit block is special for this problem and its bits are
|
/* The exit block is special for this problem and its bits are
|
computed from thin air. */
|
computed from thin air. */
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, EXIT_BLOCK);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, EXIT_BLOCK);
|
bitmap_copy (bb_info->use, df->exit_block_uses);
|
bitmap_copy (bb_info->use, df->exit_block_uses);
|
}
|
}
|
|
|
EXECUTE_IF_SET_IN_BITMAP (rescan_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (rescan_blocks, 0, bb_index, bi)
|
{
|
{
|
if (bb_index == EXIT_BLOCK)
|
if (bb_index == EXIT_BLOCK)
|
continue;
|
continue;
|
df_lr_bb_local_compute (dflow, df, bb_index);
|
df_lr_bb_local_compute (dflow, df, bb_index);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Initialize the solution vectors. */
|
/* Initialize the solution vectors. */
|
|
|
static void
|
static void
|
df_lr_init (struct dataflow *dflow, bitmap all_blocks)
|
df_lr_init (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
bitmap_copy (bb_info->in, bb_info->use);
|
bitmap_copy (bb_info->in, bb_info->use);
|
bitmap_clear (bb_info->out);
|
bitmap_clear (bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Confluence function that processes infinite loops. This might be a
|
/* Confluence function that processes infinite loops. This might be a
|
noreturn function that throws. And even if it isn't, getting the
|
noreturn function that throws. And even if it isn't, getting the
|
unwind info right helps debugging. */
|
unwind info right helps debugging. */
|
static void
|
static void
|
df_lr_confluence_0 (struct dataflow *dflow, basic_block bb)
|
df_lr_confluence_0 (struct dataflow *dflow, basic_block bb)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
|
|
bitmap op1 = df_lr_get_bb_info (dflow, bb->index)->out;
|
bitmap op1 = df_lr_get_bb_info (dflow, bb->index)->out;
|
if (bb != EXIT_BLOCK_PTR)
|
if (bb != EXIT_BLOCK_PTR)
|
bitmap_copy (op1, df->hardware_regs_used);
|
bitmap_copy (op1, df->hardware_regs_used);
|
}
|
}
|
|
|
|
|
/* Confluence function that ignores fake edges. */
|
/* Confluence function that ignores fake edges. */
|
|
|
static void
|
static void
|
df_lr_confluence_n (struct dataflow *dflow, edge e)
|
df_lr_confluence_n (struct dataflow *dflow, edge e)
|
{
|
{
|
bitmap op1 = df_lr_get_bb_info (dflow, e->src->index)->out;
|
bitmap op1 = df_lr_get_bb_info (dflow, e->src->index)->out;
|
bitmap op2 = df_lr_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op2 = df_lr_get_bb_info (dflow, e->dest->index)->in;
|
|
|
/* Call-clobbered registers die across exception and call edges. */
|
/* Call-clobbered registers die across exception and call edges. */
|
/* ??? Abnormal call edges ignored for the moment, as this gets
|
/* ??? Abnormal call edges ignored for the moment, as this gets
|
confused by sibling call edges, which crashes reg-stack. */
|
confused by sibling call edges, which crashes reg-stack. */
|
if (e->flags & EDGE_EH)
|
if (e->flags & EDGE_EH)
|
bitmap_ior_and_compl_into (op1, op2, df_invalidated_by_call);
|
bitmap_ior_and_compl_into (op1, op2, df_invalidated_by_call);
|
else
|
else
|
bitmap_ior_into (op1, op2);
|
bitmap_ior_into (op1, op2);
|
|
|
bitmap_ior_into (op1, dflow->df->hardware_regs_used);
|
bitmap_ior_into (op1, dflow->df->hardware_regs_used);
|
}
|
}
|
|
|
|
|
/* Transfer function. */
|
/* Transfer function. */
|
|
|
static bool
|
static bool
|
df_lr_transfer_function (struct dataflow *dflow, int bb_index)
|
df_lr_transfer_function (struct dataflow *dflow, int bb_index)
|
{
|
{
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb_index);
|
bitmap in = bb_info->in;
|
bitmap in = bb_info->in;
|
bitmap out = bb_info->out;
|
bitmap out = bb_info->out;
|
bitmap use = bb_info->use;
|
bitmap use = bb_info->use;
|
bitmap def = bb_info->def;
|
bitmap def = bb_info->def;
|
|
|
return bitmap_ior_and_compl (in, use, out, def);
|
return bitmap_ior_and_compl (in, use, out, def);
|
}
|
}
|
|
|
|
|
/* Free all storage associated with the problem. */
|
/* Free all storage associated with the problem. */
|
|
|
static void
|
static void
|
df_lr_free (struct dataflow *dflow)
|
df_lr_free (struct dataflow *dflow)
|
{
|
{
|
if (dflow->block_info)
|
if (dflow->block_info)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
for (i = 0; i < dflow->block_info_size; i++)
|
for (i = 0; i < dflow->block_info_size; i++)
|
{
|
{
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, i);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, i);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->use);
|
BITMAP_FREE (bb_info->use);
|
BITMAP_FREE (bb_info->def);
|
BITMAP_FREE (bb_info->def);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
}
|
}
|
}
|
}
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
|
|
dflow->block_info_size = 0;
|
dflow->block_info_size = 0;
|
free (dflow->block_info);
|
free (dflow->block_info);
|
}
|
}
|
|
|
free (dflow->problem_data);
|
free (dflow->problem_data);
|
free (dflow);
|
free (dflow);
|
}
|
}
|
|
|
|
|
/* Debugging info. */
|
/* Debugging info. */
|
|
|
static void
|
static void
|
df_lr_dump (struct dataflow *dflow, FILE *file)
|
df_lr_dump (struct dataflow *dflow, FILE *file)
|
{
|
{
|
basic_block bb;
|
basic_block bb;
|
|
|
if (!dflow->block_info)
|
if (!dflow->block_info)
|
return;
|
return;
|
|
|
fprintf (file, "Live Registers:\n");
|
fprintf (file, "Live Registers:\n");
|
FOR_ALL_BB (bb)
|
FOR_ALL_BB (bb)
|
{
|
{
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb->index);
|
struct df_lr_bb_info *bb_info = df_lr_get_bb_info (dflow, bb->index);
|
df_print_bb_index (bb, file);
|
df_print_bb_index (bb, file);
|
|
|
if (!bb_info->in)
|
if (!bb_info->in)
|
continue;
|
continue;
|
|
|
fprintf (file, " in \t");
|
fprintf (file, " in \t");
|
dump_bitmap (file, bb_info->in);
|
dump_bitmap (file, bb_info->in);
|
fprintf (file, " use \t");
|
fprintf (file, " use \t");
|
dump_bitmap (file, bb_info->use);
|
dump_bitmap (file, bb_info->use);
|
fprintf (file, " def \t");
|
fprintf (file, " def \t");
|
dump_bitmap (file, bb_info->def);
|
dump_bitmap (file, bb_info->def);
|
fprintf (file, " out \t");
|
fprintf (file, " out \t");
|
dump_bitmap (file, bb_info->out);
|
dump_bitmap (file, bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
/* All of the information associated with every instance of the problem. */
|
/* All of the information associated with every instance of the problem. */
|
|
|
static struct df_problem problem_LR =
|
static struct df_problem problem_LR =
|
{
|
{
|
DF_LR, /* Problem id. */
|
DF_LR, /* Problem id. */
|
DF_BACKWARD, /* Direction. */
|
DF_BACKWARD, /* Direction. */
|
df_lr_alloc, /* Allocate the problem specific data. */
|
df_lr_alloc, /* Allocate the problem specific data. */
|
NULL, /* Reset global information. */
|
NULL, /* Reset global information. */
|
df_lr_free_bb_info, /* Free basic block info. */
|
df_lr_free_bb_info, /* Free basic block info. */
|
df_lr_local_compute, /* Local compute function. */
|
df_lr_local_compute, /* Local compute function. */
|
df_lr_init, /* Init the solution specific data. */
|
df_lr_init, /* Init the solution specific data. */
|
df_iterative_dataflow, /* Iterative solver. */
|
df_iterative_dataflow, /* Iterative solver. */
|
df_lr_confluence_0, /* Confluence operator 0. */
|
df_lr_confluence_0, /* Confluence operator 0. */
|
df_lr_confluence_n, /* Confluence operator n. */
|
df_lr_confluence_n, /* Confluence operator n. */
|
df_lr_transfer_function, /* Transfer function. */
|
df_lr_transfer_function, /* Transfer function. */
|
NULL, /* Finalize function. */
|
NULL, /* Finalize function. */
|
df_lr_free, /* Free all of the problem information. */
|
df_lr_free, /* Free all of the problem information. */
|
df_lr_dump, /* Debugging. */
|
df_lr_dump, /* Debugging. */
|
NULL, /* Dependent problem. */
|
NULL, /* Dependent problem. */
|
0
|
0
|
};
|
};
|
|
|
|
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
of DF. The returned structure is what is used to get at the
|
of DF. The returned structure is what is used to get at the
|
solution. */
|
solution. */
|
|
|
struct dataflow *
|
struct dataflow *
|
df_lr_add_problem (struct df *df, int flags)
|
df_lr_add_problem (struct df *df, int flags)
|
{
|
{
|
return df_add_problem (df, &problem_LR, flags);
|
return df_add_problem (df, &problem_LR, flags);
|
}
|
}
|
|
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
UNINITIALIZED REGISTERS
|
UNINITIALIZED REGISTERS
|
|
|
Find the set of uses for registers that are reachable from the entry
|
Find the set of uses for registers that are reachable from the entry
|
block without passing thru a definition. In and out bitvectors are built
|
block without passing thru a definition. In and out bitvectors are built
|
for each basic block. The regnum is used to index into these sets.
|
for each basic block. The regnum is used to index into these sets.
|
See df.h for details.
|
See df.h for details.
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* Get basic block info. */
|
/* Get basic block info. */
|
|
|
struct df_ur_bb_info *
|
struct df_ur_bb_info *
|
df_ur_get_bb_info (struct dataflow *dflow, unsigned int index)
|
df_ur_get_bb_info (struct dataflow *dflow, unsigned int index)
|
{
|
{
|
return (struct df_ur_bb_info *) dflow->block_info[index];
|
return (struct df_ur_bb_info *) dflow->block_info[index];
|
}
|
}
|
|
|
|
|
/* Set basic block info. */
|
/* Set basic block info. */
|
|
|
static void
|
static void
|
df_ur_set_bb_info (struct dataflow *dflow, unsigned int index,
|
df_ur_set_bb_info (struct dataflow *dflow, unsigned int index,
|
struct df_ur_bb_info *bb_info)
|
struct df_ur_bb_info *bb_info)
|
{
|
{
|
dflow->block_info[index] = bb_info;
|
dflow->block_info[index] = bb_info;
|
}
|
}
|
|
|
|
|
/* Free basic block info. */
|
/* Free basic block info. */
|
|
|
static void
|
static void
|
df_ur_free_bb_info (struct dataflow *dflow,
|
df_ur_free_bb_info (struct dataflow *dflow,
|
basic_block bb ATTRIBUTE_UNUSED,
|
basic_block bb ATTRIBUTE_UNUSED,
|
void *vbb_info)
|
void *vbb_info)
|
{
|
{
|
struct df_ur_bb_info *bb_info = (struct df_ur_bb_info *) vbb_info;
|
struct df_ur_bb_info *bb_info = (struct df_ur_bb_info *) vbb_info;
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
pool_free (dflow->block_pool, bb_info);
|
pool_free (dflow->block_pool, bb_info);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
not touched unless the block is new. */
|
not touched unless the block is new. */
|
|
|
static void
|
static void
|
df_ur_alloc (struct dataflow *dflow, bitmap blocks_to_rescan,
|
df_ur_alloc (struct dataflow *dflow, bitmap blocks_to_rescan,
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
if (!dflow->block_pool)
|
if (!dflow->block_pool)
|
dflow->block_pool = create_alloc_pool ("df_ur_block pool",
|
dflow->block_pool = create_alloc_pool ("df_ur_block pool",
|
sizeof (struct df_ur_bb_info), 100);
|
sizeof (struct df_ur_bb_info), 100);
|
|
|
df_grow_bb_info (dflow);
|
df_grow_bb_info (dflow);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_rescan, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_rescan, 0, bb_index, bi)
|
{
|
{
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->gen);
|
bitmap_clear (bb_info->gen);
|
}
|
}
|
else
|
else
|
{
|
{
|
bb_info = (struct df_ur_bb_info *) pool_alloc (dflow->block_pool);
|
bb_info = (struct df_ur_bb_info *) pool_alloc (dflow->block_pool);
|
df_ur_set_bb_info (dflow, bb_index, bb_info);
|
df_ur_set_bb_info (dflow, bb_index, bb_info);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Compute local uninitialized register info for basic block BB. */
|
/* Compute local uninitialized register info for basic block BB. */
|
|
|
static void
|
static void
|
df_ur_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
df_ur_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
rtx insn;
|
rtx insn;
|
struct df_ref *def;
|
struct df_ref *def;
|
|
|
bitmap_clear (seen_in_block);
|
bitmap_clear (seen_in_block);
|
bitmap_clear (seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
|
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int regno = DF_REF_REGNO (def);
|
if (!bitmap_bit_p (seen_in_block, regno))
|
if (!bitmap_bit_p (seen_in_block, regno))
|
{
|
{
|
bitmap_set_bit (seen_in_block, regno);
|
bitmap_set_bit (seen_in_block, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
}
|
}
|
}
|
}
|
|
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
{
|
{
|
unsigned int uid = INSN_UID (insn);
|
unsigned int uid = INSN_UID (insn);
|
if (!INSN_P (insn))
|
if (!INSN_P (insn))
|
continue;
|
continue;
|
|
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int regno = DF_REF_REGNO (def);
|
/* Only the last def counts. */
|
/* Only the last def counts. */
|
if (!bitmap_bit_p (seen_in_block, regno))
|
if (!bitmap_bit_p (seen_in_block, regno))
|
{
|
{
|
bitmap_set_bit (seen_in_insn, regno);
|
bitmap_set_bit (seen_in_insn, regno);
|
|
|
if (DF_REF_FLAGS (def)
|
if (DF_REF_FLAGS (def)
|
& (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER))
|
& (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER))
|
{
|
{
|
/* Only must clobbers for the entire reg destroy the
|
/* Only must clobbers for the entire reg destroy the
|
value. */
|
value. */
|
if ((DF_REF_FLAGS (def) & DF_REF_MUST_CLOBBER)
|
if ((DF_REF_FLAGS (def) & DF_REF_MUST_CLOBBER)
|
&& (!DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
&& (!DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
bitmap_set_bit (bb_info->kill, regno);
|
bitmap_set_bit (bb_info->kill, regno);
|
}
|
}
|
else
|
else
|
bitmap_set_bit (bb_info->gen, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
}
|
}
|
}
|
}
|
bitmap_ior_into (seen_in_block, seen_in_insn);
|
bitmap_ior_into (seen_in_block, seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
bitmap_clear (seen_in_insn);
|
}
|
}
|
|
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if (DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
if (DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int regno = DF_REF_REGNO (def);
|
if (!bitmap_bit_p (seen_in_block, regno))
|
if (!bitmap_bit_p (seen_in_block, regno))
|
{
|
{
|
bitmap_set_bit (seen_in_block, regno);
|
bitmap_set_bit (seen_in_block, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Compute local uninitialized register info. */
|
/* Compute local uninitialized register info. */
|
|
|
static void
|
static void
|
df_ur_local_compute (struct dataflow *dflow,
|
df_ur_local_compute (struct dataflow *dflow,
|
bitmap all_blocks ATTRIBUTE_UNUSED,
|
bitmap all_blocks ATTRIBUTE_UNUSED,
|
bitmap rescan_blocks)
|
bitmap rescan_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
df_set_seen ();
|
df_set_seen ();
|
|
|
EXECUTE_IF_SET_IN_BITMAP (rescan_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (rescan_blocks, 0, bb_index, bi)
|
{
|
{
|
df_ur_bb_local_compute (dflow, bb_index);
|
df_ur_bb_local_compute (dflow, bb_index);
|
}
|
}
|
|
|
df_unset_seen ();
|
df_unset_seen ();
|
}
|
}
|
|
|
|
|
/* Initialize the solution vectors. */
|
/* Initialize the solution vectors. */
|
|
|
static void
|
static void
|
df_ur_init (struct dataflow *dflow, bitmap all_blocks)
|
df_ur_init (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
|
|
bitmap_copy (bb_info->out, bb_info->gen);
|
bitmap_copy (bb_info->out, bb_info->gen);
|
bitmap_clear (bb_info->in);
|
bitmap_clear (bb_info->in);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Or in the stack regs, hard regs and early clobber regs into the the
|
/* Or in the stack regs, hard regs and early clobber regs into the the
|
ur_in sets of all of the blocks. */
|
ur_in sets of all of the blocks. */
|
|
|
static void
|
static void
|
df_ur_local_finalize (struct dataflow *dflow, bitmap all_blocks)
|
df_ur_local_finalize (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
struct dataflow *lr_dflow = df->problems_by_index[DF_LR];
|
struct dataflow *lr_dflow = df->problems_by_index[DF_LR];
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int bb_index;
|
unsigned int bb_index;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
struct df_lr_bb_info *bb_lr_info = df_lr_get_bb_info (lr_dflow, bb_index);
|
struct df_lr_bb_info *bb_lr_info = df_lr_get_bb_info (lr_dflow, bb_index);
|
|
|
/* No register may reach a location where it is not used. Thus
|
/* No register may reach a location where it is not used. Thus
|
we trim the rr result to the places where it is used. */
|
we trim the rr result to the places where it is used. */
|
bitmap_and_into (bb_info->in, bb_lr_info->in);
|
bitmap_and_into (bb_info->in, bb_lr_info->in);
|
bitmap_and_into (bb_info->out, bb_lr_info->out);
|
bitmap_and_into (bb_info->out, bb_lr_info->out);
|
|
|
#if 1
|
#if 1
|
/* Hard registers may still stick in the ur_out set, but not
|
/* Hard registers may still stick in the ur_out set, but not
|
be in the ur_in set, if their only mention was in a call
|
be in the ur_in set, if their only mention was in a call
|
in this block. This is because a call kills in the lr
|
in this block. This is because a call kills in the lr
|
problem but does not kill in the ur problem. To clean
|
problem but does not kill in the ur problem. To clean
|
this up, we execute the transfer function on the lr_in
|
this up, we execute the transfer function on the lr_in
|
set and then use that to knock bits out of ur_out. */
|
set and then use that to knock bits out of ur_out. */
|
bitmap_ior_and_compl (tmp, bb_info->gen, bb_lr_info->in,
|
bitmap_ior_and_compl (tmp, bb_info->gen, bb_lr_info->in,
|
bb_info->kill);
|
bb_info->kill);
|
bitmap_and_into (bb_info->out, tmp);
|
bitmap_and_into (bb_info->out, tmp);
|
#endif
|
#endif
|
}
|
}
|
|
|
BITMAP_FREE (tmp);
|
BITMAP_FREE (tmp);
|
}
|
}
|
|
|
|
|
/* Confluence function that ignores fake edges. */
|
/* Confluence function that ignores fake edges. */
|
|
|
static void
|
static void
|
df_ur_confluence_n (struct dataflow *dflow, edge e)
|
df_ur_confluence_n (struct dataflow *dflow, edge e)
|
{
|
{
|
bitmap op1 = df_ur_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op1 = df_ur_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op2 = df_ur_get_bb_info (dflow, e->src->index)->out;
|
bitmap op2 = df_ur_get_bb_info (dflow, e->src->index)->out;
|
|
|
if (e->flags & EDGE_FAKE)
|
if (e->flags & EDGE_FAKE)
|
return;
|
return;
|
|
|
bitmap_ior_into (op1, op2);
|
bitmap_ior_into (op1, op2);
|
}
|
}
|
|
|
|
|
/* Transfer function. */
|
/* Transfer function. */
|
|
|
static bool
|
static bool
|
df_ur_transfer_function (struct dataflow *dflow, int bb_index)
|
df_ur_transfer_function (struct dataflow *dflow, int bb_index)
|
{
|
{
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb_index);
|
bitmap in = bb_info->in;
|
bitmap in = bb_info->in;
|
bitmap out = bb_info->out;
|
bitmap out = bb_info->out;
|
bitmap gen = bb_info->gen;
|
bitmap gen = bb_info->gen;
|
bitmap kill = bb_info->kill;
|
bitmap kill = bb_info->kill;
|
|
|
return bitmap_ior_and_compl (out, gen, in, kill);
|
return bitmap_ior_and_compl (out, gen, in, kill);
|
}
|
}
|
|
|
|
|
/* Free all storage associated with the problem. */
|
/* Free all storage associated with the problem. */
|
|
|
static void
|
static void
|
df_ur_free (struct dataflow *dflow)
|
df_ur_free (struct dataflow *dflow)
|
{
|
{
|
if (dflow->block_info)
|
if (dflow->block_info)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
|
|
for (i = 0; i < dflow->block_info_size; i++)
|
for (i = 0; i < dflow->block_info_size; i++)
|
{
|
{
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, i);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, i);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
dflow->block_info_size = 0;
|
dflow->block_info_size = 0;
|
free (dflow->block_info);
|
free (dflow->block_info);
|
}
|
}
|
free (dflow);
|
free (dflow);
|
}
|
}
|
|
|
|
|
/* Debugging info. */
|
/* Debugging info. */
|
|
|
static void
|
static void
|
df_ur_dump (struct dataflow *dflow, FILE *file)
|
df_ur_dump (struct dataflow *dflow, FILE *file)
|
{
|
{
|
basic_block bb;
|
basic_block bb;
|
|
|
if (!dflow->block_info)
|
if (!dflow->block_info)
|
return;
|
return;
|
|
|
fprintf (file, "Undefined regs:\n");
|
fprintf (file, "Undefined regs:\n");
|
|
|
FOR_ALL_BB (bb)
|
FOR_ALL_BB (bb)
|
{
|
{
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb->index);
|
struct df_ur_bb_info *bb_info = df_ur_get_bb_info (dflow, bb->index);
|
df_print_bb_index (bb, file);
|
df_print_bb_index (bb, file);
|
|
|
if (!bb_info->in)
|
if (!bb_info->in)
|
continue;
|
continue;
|
|
|
fprintf (file, " in \t");
|
fprintf (file, " in \t");
|
dump_bitmap (file, bb_info->in);
|
dump_bitmap (file, bb_info->in);
|
fprintf (file, " gen \t");
|
fprintf (file, " gen \t");
|
dump_bitmap (file, bb_info->gen);
|
dump_bitmap (file, bb_info->gen);
|
fprintf (file, " kill\t");
|
fprintf (file, " kill\t");
|
dump_bitmap (file, bb_info->kill);
|
dump_bitmap (file, bb_info->kill);
|
fprintf (file, " out \t");
|
fprintf (file, " out \t");
|
dump_bitmap (file, bb_info->out);
|
dump_bitmap (file, bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
/* All of the information associated with every instance of the problem. */
|
/* All of the information associated with every instance of the problem. */
|
|
|
static struct df_problem problem_UR =
|
static struct df_problem problem_UR =
|
{
|
{
|
DF_UR, /* Problem id. */
|
DF_UR, /* Problem id. */
|
DF_FORWARD, /* Direction. */
|
DF_FORWARD, /* Direction. */
|
df_ur_alloc, /* Allocate the problem specific data. */
|
df_ur_alloc, /* Allocate the problem specific data. */
|
NULL, /* Reset global information. */
|
NULL, /* Reset global information. */
|
df_ur_free_bb_info, /* Free basic block info. */
|
df_ur_free_bb_info, /* Free basic block info. */
|
df_ur_local_compute, /* Local compute function. */
|
df_ur_local_compute, /* Local compute function. */
|
df_ur_init, /* Init the solution specific data. */
|
df_ur_init, /* Init the solution specific data. */
|
df_iterative_dataflow, /* Iterative solver. */
|
df_iterative_dataflow, /* Iterative solver. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator 0. */
|
df_ur_confluence_n, /* Confluence operator n. */
|
df_ur_confluence_n, /* Confluence operator n. */
|
df_ur_transfer_function, /* Transfer function. */
|
df_ur_transfer_function, /* Transfer function. */
|
df_ur_local_finalize, /* Finalize function. */
|
df_ur_local_finalize, /* Finalize function. */
|
df_ur_free, /* Free all of the problem information. */
|
df_ur_free, /* Free all of the problem information. */
|
df_ur_dump, /* Debugging. */
|
df_ur_dump, /* Debugging. */
|
df_lr_add_problem, /* Dependent problem. */
|
df_lr_add_problem, /* Dependent problem. */
|
0 /* Changeable flags. */
|
0 /* Changeable flags. */
|
};
|
};
|
|
|
|
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
of DF. The returned structure is what is used to get at the
|
of DF. The returned structure is what is used to get at the
|
solution. */
|
solution. */
|
|
|
struct dataflow *
|
struct dataflow *
|
df_ur_add_problem (struct df *df, int flags)
|
df_ur_add_problem (struct df *df, int flags)
|
{
|
{
|
return df_add_problem (df, &problem_UR, flags);
|
return df_add_problem (df, &problem_UR, flags);
|
}
|
}
|
|
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
UNINITIALIZED REGISTERS WITH EARLYCLOBBER
|
UNINITIALIZED REGISTERS WITH EARLYCLOBBER
|
|
|
Find the set of uses for registers that are reachable from the entry
|
Find the set of uses for registers that are reachable from the entry
|
block without passing thru a definition. In and out bitvectors are built
|
block without passing thru a definition. In and out bitvectors are built
|
for each basic block. The regnum is used to index into these sets.
|
for each basic block. The regnum is used to index into these sets.
|
See df.h for details.
|
See df.h for details.
|
|
|
This is a variant of the UR problem above that has a lot of special
|
This is a variant of the UR problem above that has a lot of special
|
features just for the register allocation phase. This problem
|
features just for the register allocation phase. This problem
|
should go a away if someone would fix the interference graph.
|
should go a away if someone would fix the interference graph.
|
|
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* Private data used to compute the solution for this problem. These
|
/* Private data used to compute the solution for this problem. These
|
data structures are not accessible outside of this module. */
|
data structures are not accessible outside of this module. */
|
struct df_urec_problem_data
|
struct df_urec_problem_data
|
{
|
{
|
bool earlyclobbers_found; /* True if any instruction contains an
|
bool earlyclobbers_found; /* True if any instruction contains an
|
earlyclobber. */
|
earlyclobber. */
|
#ifdef STACK_REGS
|
#ifdef STACK_REGS
|
bitmap stack_regs; /* Registers that may be allocated to a STACK_REGS. */
|
bitmap stack_regs; /* Registers that may be allocated to a STACK_REGS. */
|
#endif
|
#endif
|
};
|
};
|
|
|
|
|
/* Get basic block info. */
|
/* Get basic block info. */
|
|
|
struct df_urec_bb_info *
|
struct df_urec_bb_info *
|
df_urec_get_bb_info (struct dataflow *dflow, unsigned int index)
|
df_urec_get_bb_info (struct dataflow *dflow, unsigned int index)
|
{
|
{
|
return (struct df_urec_bb_info *) dflow->block_info[index];
|
return (struct df_urec_bb_info *) dflow->block_info[index];
|
}
|
}
|
|
|
|
|
/* Set basic block info. */
|
/* Set basic block info. */
|
|
|
static void
|
static void
|
df_urec_set_bb_info (struct dataflow *dflow, unsigned int index,
|
df_urec_set_bb_info (struct dataflow *dflow, unsigned int index,
|
struct df_urec_bb_info *bb_info)
|
struct df_urec_bb_info *bb_info)
|
{
|
{
|
dflow->block_info[index] = bb_info;
|
dflow->block_info[index] = bb_info;
|
}
|
}
|
|
|
|
|
/* Free basic block info. */
|
/* Free basic block info. */
|
|
|
static void
|
static void
|
df_urec_free_bb_info (struct dataflow *dflow,
|
df_urec_free_bb_info (struct dataflow *dflow,
|
basic_block bb ATTRIBUTE_UNUSED,
|
basic_block bb ATTRIBUTE_UNUSED,
|
void *vbb_info)
|
void *vbb_info)
|
{
|
{
|
struct df_urec_bb_info *bb_info = (struct df_urec_bb_info *) vbb_info;
|
struct df_urec_bb_info *bb_info = (struct df_urec_bb_info *) vbb_info;
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->earlyclobber);
|
BITMAP_FREE (bb_info->earlyclobber);
|
pool_free (dflow->block_pool, bb_info);
|
pool_free (dflow->block_pool, bb_info);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
/* Allocate or reset bitmaps for DFLOW blocks. The solution bits are
|
not touched unless the block is new. */
|
not touched unless the block is new. */
|
|
|
static void
|
static void
|
df_urec_alloc (struct dataflow *dflow, bitmap blocks_to_rescan,
|
df_urec_alloc (struct dataflow *dflow, bitmap blocks_to_rescan,
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
|
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
struct df_urec_problem_data *problem_data
|
struct df_urec_problem_data *problem_data
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
|
|
if (!dflow->block_pool)
|
if (!dflow->block_pool)
|
dflow->block_pool = create_alloc_pool ("df_urec_block pool",
|
dflow->block_pool = create_alloc_pool ("df_urec_block pool",
|
sizeof (struct df_urec_bb_info), 50);
|
sizeof (struct df_urec_bb_info), 50);
|
|
|
if (!dflow->problem_data)
|
if (!dflow->problem_data)
|
{
|
{
|
problem_data = XNEW (struct df_urec_problem_data);
|
problem_data = XNEW (struct df_urec_problem_data);
|
dflow->problem_data = problem_data;
|
dflow->problem_data = problem_data;
|
}
|
}
|
problem_data->earlyclobbers_found = false;
|
problem_data->earlyclobbers_found = false;
|
|
|
df_grow_bb_info (dflow);
|
df_grow_bb_info (dflow);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_rescan, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_rescan, 0, bb_index, bi)
|
{
|
{
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->kill);
|
bitmap_clear (bb_info->gen);
|
bitmap_clear (bb_info->gen);
|
bitmap_clear (bb_info->earlyclobber);
|
bitmap_clear (bb_info->earlyclobber);
|
}
|
}
|
else
|
else
|
{
|
{
|
bb_info = (struct df_urec_bb_info *) pool_alloc (dflow->block_pool);
|
bb_info = (struct df_urec_bb_info *) pool_alloc (dflow->block_pool);
|
df_urec_set_bb_info (dflow, bb_index, bb_info);
|
df_urec_set_bb_info (dflow, bb_index, bb_info);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->kill = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->gen = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->in = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
bb_info->out = BITMAP_ALLOC (NULL);
|
bb_info->earlyclobber = BITMAP_ALLOC (NULL);
|
bb_info->earlyclobber = BITMAP_ALLOC (NULL);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* The function modifies local info for register REG being changed in
|
/* The function modifies local info for register REG being changed in
|
SETTER. DATA is used to pass the current basic block info. */
|
SETTER. DATA is used to pass the current basic block info. */
|
|
|
static void
|
static void
|
df_urec_mark_reg_change (rtx reg, rtx setter, void *data)
|
df_urec_mark_reg_change (rtx reg, rtx setter, void *data)
|
{
|
{
|
int regno;
|
int regno;
|
int endregno;
|
int endregno;
|
int i;
|
int i;
|
struct df_urec_bb_info *bb_info = (struct df_urec_bb_info*) data;
|
struct df_urec_bb_info *bb_info = (struct df_urec_bb_info*) data;
|
|
|
if (GET_CODE (reg) == SUBREG)
|
if (GET_CODE (reg) == SUBREG)
|
reg = SUBREG_REG (reg);
|
reg = SUBREG_REG (reg);
|
|
|
if (!REG_P (reg))
|
if (!REG_P (reg))
|
return;
|
return;
|
|
|
|
|
endregno = regno = REGNO (reg);
|
endregno = regno = REGNO (reg);
|
if (regno < FIRST_PSEUDO_REGISTER)
|
if (regno < FIRST_PSEUDO_REGISTER)
|
{
|
{
|
endregno +=hard_regno_nregs[regno][GET_MODE (reg)];
|
endregno +=hard_regno_nregs[regno][GET_MODE (reg)];
|
|
|
for (i = regno; i < endregno; i++)
|
for (i = regno; i < endregno; i++)
|
{
|
{
|
bitmap_set_bit (bb_info->kill, i);
|
bitmap_set_bit (bb_info->kill, i);
|
|
|
if (GET_CODE (setter) != CLOBBER)
|
if (GET_CODE (setter) != CLOBBER)
|
bitmap_set_bit (bb_info->gen, i);
|
bitmap_set_bit (bb_info->gen, i);
|
else
|
else
|
bitmap_clear_bit (bb_info->gen, i);
|
bitmap_clear_bit (bb_info->gen, i);
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
bitmap_set_bit (bb_info->kill, regno);
|
bitmap_set_bit (bb_info->kill, regno);
|
|
|
if (GET_CODE (setter) != CLOBBER)
|
if (GET_CODE (setter) != CLOBBER)
|
bitmap_set_bit (bb_info->gen, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
else
|
else
|
bitmap_clear_bit (bb_info->gen, regno);
|
bitmap_clear_bit (bb_info->gen, regno);
|
}
|
}
|
}
|
}
|
/* Classes of registers which could be early clobbered in the current
|
/* Classes of registers which could be early clobbered in the current
|
insn. */
|
insn. */
|
|
|
static VEC(int,heap) *earlyclobber_regclass;
|
static VEC(int,heap) *earlyclobber_regclass;
|
|
|
/* This function finds and stores register classes that could be early
|
/* This function finds and stores register classes that could be early
|
clobbered in INSN. If any earlyclobber classes are found, the function
|
clobbered in INSN. If any earlyclobber classes are found, the function
|
returns TRUE, in all other cases it returns FALSE. */
|
returns TRUE, in all other cases it returns FALSE. */
|
|
|
static bool
|
static bool
|
df_urec_check_earlyclobber (rtx insn)
|
df_urec_check_earlyclobber (rtx insn)
|
{
|
{
|
int opno;
|
int opno;
|
bool found = false;
|
bool found = false;
|
|
|
extract_insn (insn);
|
extract_insn (insn);
|
|
|
VEC_truncate (int, earlyclobber_regclass, 0);
|
VEC_truncate (int, earlyclobber_regclass, 0);
|
for (opno = 0; opno < recog_data.n_operands; opno++)
|
for (opno = 0; opno < recog_data.n_operands; opno++)
|
{
|
{
|
char c;
|
char c;
|
bool amp_p;
|
bool amp_p;
|
int i;
|
int i;
|
enum reg_class class;
|
enum reg_class class;
|
const char *p = recog_data.constraints[opno];
|
const char *p = recog_data.constraints[opno];
|
|
|
class = NO_REGS;
|
class = NO_REGS;
|
amp_p = false;
|
amp_p = false;
|
for (;;)
|
for (;;)
|
{
|
{
|
c = *p;
|
c = *p;
|
switch (c)
|
switch (c)
|
{
|
{
|
case '=': case '+': case '?':
|
case '=': case '+': case '?':
|
case '#': case '!':
|
case '#': case '!':
|
case '*': case '%':
|
case '*': case '%':
|
case 'm': case '<': case '>': case 'V': case 'o':
|
case 'm': case '<': case '>': case 'V': case 'o':
|
case 'E': case 'F': case 'G': case 'H':
|
case 'E': case 'F': case 'G': case 'H':
|
case 's': case 'i': case 'n':
|
case 's': case 'i': case 'n':
|
case 'I': case 'J': case 'K': case 'L':
|
case 'I': case 'J': case 'K': case 'L':
|
case 'M': case 'N': case 'O': case 'P':
|
case 'M': case 'N': case 'O': case 'P':
|
case 'X':
|
case 'X':
|
case '0': case '1': case '2': case '3': case '4':
|
case '0': case '1': case '2': case '3': case '4':
|
case '5': case '6': case '7': case '8': case '9':
|
case '5': case '6': case '7': case '8': case '9':
|
/* These don't say anything we care about. */
|
/* These don't say anything we care about. */
|
break;
|
break;
|
|
|
case '&':
|
case '&':
|
amp_p = true;
|
amp_p = true;
|
break;
|
break;
|
case '\0':
|
case '\0':
|
case ',':
|
case ',':
|
if (amp_p && class != NO_REGS)
|
if (amp_p && class != NO_REGS)
|
{
|
{
|
int rc;
|
int rc;
|
|
|
found = true;
|
found = true;
|
for (i = 0;
|
for (i = 0;
|
VEC_iterate (int, earlyclobber_regclass, i, rc);
|
VEC_iterate (int, earlyclobber_regclass, i, rc);
|
i++)
|
i++)
|
{
|
{
|
if (rc == (int) class)
|
if (rc == (int) class)
|
goto found_rc;
|
goto found_rc;
|
}
|
}
|
|
|
/* We use VEC_quick_push here because
|
/* We use VEC_quick_push here because
|
earlyclobber_regclass holds no more than
|
earlyclobber_regclass holds no more than
|
N_REG_CLASSES elements. */
|
N_REG_CLASSES elements. */
|
VEC_quick_push (int, earlyclobber_regclass, (int) class);
|
VEC_quick_push (int, earlyclobber_regclass, (int) class);
|
found_rc:
|
found_rc:
|
;
|
;
|
}
|
}
|
|
|
amp_p = false;
|
amp_p = false;
|
class = NO_REGS;
|
class = NO_REGS;
|
break;
|
break;
|
|
|
case 'r':
|
case 'r':
|
class = GENERAL_REGS;
|
class = GENERAL_REGS;
|
break;
|
break;
|
|
|
default:
|
default:
|
class = REG_CLASS_FROM_CONSTRAINT (c, p);
|
class = REG_CLASS_FROM_CONSTRAINT (c, p);
|
break;
|
break;
|
}
|
}
|
if (c == '\0')
|
if (c == '\0')
|
break;
|
break;
|
p += CONSTRAINT_LEN (c, p);
|
p += CONSTRAINT_LEN (c, p);
|
}
|
}
|
}
|
}
|
|
|
return found;
|
return found;
|
}
|
}
|
|
|
/* The function checks that pseudo-register *X has a class
|
/* The function checks that pseudo-register *X has a class
|
intersecting with the class of pseudo-register could be early
|
intersecting with the class of pseudo-register could be early
|
clobbered in the same insn.
|
clobbered in the same insn.
|
|
|
This function is a no-op if earlyclobber_regclass is empty.
|
This function is a no-op if earlyclobber_regclass is empty.
|
|
|
Reload can assign the same hard register to uninitialized
|
Reload can assign the same hard register to uninitialized
|
pseudo-register and early clobbered pseudo-register in an insn if
|
pseudo-register and early clobbered pseudo-register in an insn if
|
the pseudo-register is used first time in given BB and not lived at
|
the pseudo-register is used first time in given BB and not lived at
|
the BB start. To prevent this we don't change life information for
|
the BB start. To prevent this we don't change life information for
|
such pseudo-registers. */
|
such pseudo-registers. */
|
|
|
static int
|
static int
|
df_urec_mark_reg_use_for_earlyclobber (rtx *x, void *data)
|
df_urec_mark_reg_use_for_earlyclobber (rtx *x, void *data)
|
{
|
{
|
enum reg_class pref_class, alt_class;
|
enum reg_class pref_class, alt_class;
|
int i, regno;
|
int i, regno;
|
struct df_urec_bb_info *bb_info = (struct df_urec_bb_info*) data;
|
struct df_urec_bb_info *bb_info = (struct df_urec_bb_info*) data;
|
|
|
if (REG_P (*x) && REGNO (*x) >= FIRST_PSEUDO_REGISTER)
|
if (REG_P (*x) && REGNO (*x) >= FIRST_PSEUDO_REGISTER)
|
{
|
{
|
int rc;
|
int rc;
|
|
|
regno = REGNO (*x);
|
regno = REGNO (*x);
|
if (bitmap_bit_p (bb_info->kill, regno)
|
if (bitmap_bit_p (bb_info->kill, regno)
|
|| bitmap_bit_p (bb_info->gen, regno))
|
|| bitmap_bit_p (bb_info->gen, regno))
|
return 0;
|
return 0;
|
pref_class = reg_preferred_class (regno);
|
pref_class = reg_preferred_class (regno);
|
alt_class = reg_alternate_class (regno);
|
alt_class = reg_alternate_class (regno);
|
for (i = 0; VEC_iterate (int, earlyclobber_regclass, i, rc); i++)
|
for (i = 0; VEC_iterate (int, earlyclobber_regclass, i, rc); i++)
|
{
|
{
|
if (reg_classes_intersect_p (rc, pref_class)
|
if (reg_classes_intersect_p (rc, pref_class)
|
|| (rc != NO_REGS
|
|| (rc != NO_REGS
|
&& reg_classes_intersect_p (rc, alt_class)))
|
&& reg_classes_intersect_p (rc, alt_class)))
|
{
|
{
|
bitmap_set_bit (bb_info->earlyclobber, regno);
|
bitmap_set_bit (bb_info->earlyclobber, regno);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* The function processes all pseudo-registers in *X with the aid of
|
/* The function processes all pseudo-registers in *X with the aid of
|
previous function. */
|
previous function. */
|
|
|
static void
|
static void
|
df_urec_mark_reg_use_for_earlyclobber_1 (rtx *x, void *data)
|
df_urec_mark_reg_use_for_earlyclobber_1 (rtx *x, void *data)
|
{
|
{
|
for_each_rtx (x, df_urec_mark_reg_use_for_earlyclobber, data);
|
for_each_rtx (x, df_urec_mark_reg_use_for_earlyclobber, data);
|
}
|
}
|
|
|
|
|
/* Compute local uninitialized register info for basic block BB. */
|
/* Compute local uninitialized register info for basic block BB. */
|
|
|
static void
|
static void
|
df_urec_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
df_urec_bb_local_compute (struct dataflow *dflow, unsigned int bb_index)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
rtx insn;
|
rtx insn;
|
struct df_ref *def;
|
struct df_ref *def;
|
|
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if (DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
if (DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int regno = DF_REF_REGNO (def);
|
bitmap_set_bit (bb_info->gen, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
}
|
}
|
|
|
FOR_BB_INSNS (bb, insn)
|
FOR_BB_INSNS (bb, insn)
|
{
|
{
|
if (INSN_P (insn))
|
if (INSN_P (insn))
|
{
|
{
|
note_stores (PATTERN (insn), df_urec_mark_reg_change, bb_info);
|
note_stores (PATTERN (insn), df_urec_mark_reg_change, bb_info);
|
if (df_urec_check_earlyclobber (insn))
|
if (df_urec_check_earlyclobber (insn))
|
{
|
{
|
struct df_urec_problem_data *problem_data
|
struct df_urec_problem_data *problem_data
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
problem_data->earlyclobbers_found = true;
|
problem_data->earlyclobbers_found = true;
|
note_uses (&PATTERN (insn),
|
note_uses (&PATTERN (insn),
|
df_urec_mark_reg_use_for_earlyclobber_1, bb_info);
|
df_urec_mark_reg_use_for_earlyclobber_1, bb_info);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (def);
|
unsigned int regno = DF_REF_REGNO (def);
|
bitmap_set_bit (bb_info->gen, regno);
|
bitmap_set_bit (bb_info->gen, regno);
|
}
|
}
|
|
|
}
|
}
|
|
|
|
|
/* Compute local uninitialized register info. */
|
/* Compute local uninitialized register info. */
|
|
|
static void
|
static void
|
df_urec_local_compute (struct dataflow *dflow,
|
df_urec_local_compute (struct dataflow *dflow,
|
bitmap all_blocks ATTRIBUTE_UNUSED,
|
bitmap all_blocks ATTRIBUTE_UNUSED,
|
bitmap rescan_blocks)
|
bitmap rescan_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
#ifdef STACK_REGS
|
#ifdef STACK_REGS
|
int i;
|
int i;
|
HARD_REG_SET zero, stack_hard_regs, used;
|
HARD_REG_SET zero, stack_hard_regs, used;
|
struct df_urec_problem_data *problem_data
|
struct df_urec_problem_data *problem_data
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
|
|
/* Any register that MAY be allocated to a register stack (like the
|
/* Any register that MAY be allocated to a register stack (like the
|
387) is treated poorly. Each such register is marked as being
|
387) is treated poorly. Each such register is marked as being
|
live everywhere. This keeps the register allocator and the
|
live everywhere. This keeps the register allocator and the
|
subsequent passes from doing anything useful with these values.
|
subsequent passes from doing anything useful with these values.
|
|
|
FIXME: This seems like an incredibly poor idea. */
|
FIXME: This seems like an incredibly poor idea. */
|
|
|
CLEAR_HARD_REG_SET (zero);
|
CLEAR_HARD_REG_SET (zero);
|
CLEAR_HARD_REG_SET (stack_hard_regs);
|
CLEAR_HARD_REG_SET (stack_hard_regs);
|
for (i = FIRST_STACK_REG; i <= LAST_STACK_REG; i++)
|
for (i = FIRST_STACK_REG; i <= LAST_STACK_REG; i++)
|
SET_HARD_REG_BIT (stack_hard_regs, i);
|
SET_HARD_REG_BIT (stack_hard_regs, i);
|
problem_data->stack_regs = BITMAP_ALLOC (NULL);
|
problem_data->stack_regs = BITMAP_ALLOC (NULL);
|
for (i = FIRST_PSEUDO_REGISTER; i < max_regno; i++)
|
for (i = FIRST_PSEUDO_REGISTER; i < max_regno; i++)
|
{
|
{
|
COPY_HARD_REG_SET (used, reg_class_contents[reg_preferred_class (i)]);
|
COPY_HARD_REG_SET (used, reg_class_contents[reg_preferred_class (i)]);
|
IOR_HARD_REG_SET (used, reg_class_contents[reg_alternate_class (i)]);
|
IOR_HARD_REG_SET (used, reg_class_contents[reg_alternate_class (i)]);
|
AND_HARD_REG_SET (used, stack_hard_regs);
|
AND_HARD_REG_SET (used, stack_hard_regs);
|
GO_IF_HARD_REG_EQUAL (used, zero, skip);
|
GO_IF_HARD_REG_EQUAL (used, zero, skip);
|
bitmap_set_bit (problem_data->stack_regs, i);
|
bitmap_set_bit (problem_data->stack_regs, i);
|
skip:
|
skip:
|
;
|
;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* We know that earlyclobber_regclass holds no more than
|
/* We know that earlyclobber_regclass holds no more than
|
N_REG_CLASSES elements. See df_urec_check_earlyclobber. */
|
N_REG_CLASSES elements. See df_urec_check_earlyclobber. */
|
earlyclobber_regclass = VEC_alloc (int, heap, N_REG_CLASSES);
|
earlyclobber_regclass = VEC_alloc (int, heap, N_REG_CLASSES);
|
|
|
EXECUTE_IF_SET_IN_BITMAP (rescan_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (rescan_blocks, 0, bb_index, bi)
|
{
|
{
|
df_urec_bb_local_compute (dflow, bb_index);
|
df_urec_bb_local_compute (dflow, bb_index);
|
}
|
}
|
|
|
VEC_free (int, heap, earlyclobber_regclass);
|
VEC_free (int, heap, earlyclobber_regclass);
|
}
|
}
|
|
|
|
|
/* Initialize the solution vectors. */
|
/* Initialize the solution vectors. */
|
|
|
static void
|
static void
|
df_urec_init (struct dataflow *dflow, bitmap all_blocks)
|
df_urec_init (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
|
|
bitmap_copy (bb_info->out, bb_info->gen);
|
bitmap_copy (bb_info->out, bb_info->gen);
|
bitmap_clear (bb_info->in);
|
bitmap_clear (bb_info->in);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Or in the stack regs, hard regs and early clobber regs into the the
|
/* Or in the stack regs, hard regs and early clobber regs into the the
|
ur_in sets of all of the blocks. */
|
ur_in sets of all of the blocks. */
|
|
|
static void
|
static void
|
df_urec_local_finalize (struct dataflow *dflow, bitmap all_blocks)
|
df_urec_local_finalize (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
struct dataflow *lr_dflow = df->problems_by_index[DF_LR];
|
struct dataflow *lr_dflow = df->problems_by_index[DF_LR];
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap tmp = BITMAP_ALLOC (NULL);
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int bb_index;
|
unsigned int bb_index;
|
struct df_urec_problem_data *problem_data
|
struct df_urec_problem_data *problem_data
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
= (struct df_urec_problem_data *) dflow->problem_data;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
struct df_lr_bb_info *bb_lr_info = df_lr_get_bb_info (lr_dflow, bb_index);
|
struct df_lr_bb_info *bb_lr_info = df_lr_get_bb_info (lr_dflow, bb_index);
|
|
|
if (bb_index != ENTRY_BLOCK && bb_index != EXIT_BLOCK)
|
if (bb_index != ENTRY_BLOCK && bb_index != EXIT_BLOCK)
|
{
|
{
|
if (problem_data->earlyclobbers_found)
|
if (problem_data->earlyclobbers_found)
|
bitmap_ior_into (bb_info->in, bb_info->earlyclobber);
|
bitmap_ior_into (bb_info->in, bb_info->earlyclobber);
|
|
|
#ifdef STACK_REGS
|
#ifdef STACK_REGS
|
/* We can not use the same stack register for uninitialized
|
/* We can not use the same stack register for uninitialized
|
pseudo-register and another living pseudo-register
|
pseudo-register and another living pseudo-register
|
because if the uninitialized pseudo-register dies,
|
because if the uninitialized pseudo-register dies,
|
subsequent pass reg-stack will be confused (it will
|
subsequent pass reg-stack will be confused (it will
|
believe that the other register dies). */
|
believe that the other register dies). */
|
bitmap_ior_into (bb_info->in, problem_data->stack_regs);
|
bitmap_ior_into (bb_info->in, problem_data->stack_regs);
|
bitmap_ior_into (bb_info->out, problem_data->stack_regs);
|
bitmap_ior_into (bb_info->out, problem_data->stack_regs);
|
#endif
|
#endif
|
}
|
}
|
|
|
/* No register may reach a location where it is not used. Thus
|
/* No register may reach a location where it is not used. Thus
|
we trim the rr result to the places where it is used. */
|
we trim the rr result to the places where it is used. */
|
bitmap_and_into (bb_info->in, bb_lr_info->in);
|
bitmap_and_into (bb_info->in, bb_lr_info->in);
|
bitmap_and_into (bb_info->out, bb_lr_info->out);
|
bitmap_and_into (bb_info->out, bb_lr_info->out);
|
|
|
#if 1
|
#if 1
|
/* Hard registers may still stick in the ur_out set, but not
|
/* Hard registers may still stick in the ur_out set, but not
|
be in the ur_in set, if their only mention was in a call
|
be in the ur_in set, if their only mention was in a call
|
in this block. This is because a call kills in the lr
|
in this block. This is because a call kills in the lr
|
problem but does not kill in the rr problem. To clean
|
problem but does not kill in the rr problem. To clean
|
this up, we execute the transfer function on the lr_in
|
this up, we execute the transfer function on the lr_in
|
set and then use that to knock bits out of ur_out. */
|
set and then use that to knock bits out of ur_out. */
|
bitmap_ior_and_compl (tmp, bb_info->gen, bb_lr_info->in,
|
bitmap_ior_and_compl (tmp, bb_info->gen, bb_lr_info->in,
|
bb_info->kill);
|
bb_info->kill);
|
bitmap_and_into (bb_info->out, tmp);
|
bitmap_and_into (bb_info->out, tmp);
|
#endif
|
#endif
|
}
|
}
|
|
|
#ifdef STACK_REGS
|
#ifdef STACK_REGS
|
BITMAP_FREE (problem_data->stack_regs);
|
BITMAP_FREE (problem_data->stack_regs);
|
#endif
|
#endif
|
BITMAP_FREE (tmp);
|
BITMAP_FREE (tmp);
|
}
|
}
|
|
|
|
|
/* Confluence function that ignores fake edges. */
|
/* Confluence function that ignores fake edges. */
|
|
|
static void
|
static void
|
df_urec_confluence_n (struct dataflow *dflow, edge e)
|
df_urec_confluence_n (struct dataflow *dflow, edge e)
|
{
|
{
|
bitmap op1 = df_urec_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op1 = df_urec_get_bb_info (dflow, e->dest->index)->in;
|
bitmap op2 = df_urec_get_bb_info (dflow, e->src->index)->out;
|
bitmap op2 = df_urec_get_bb_info (dflow, e->src->index)->out;
|
|
|
if (e->flags & EDGE_FAKE)
|
if (e->flags & EDGE_FAKE)
|
return;
|
return;
|
|
|
bitmap_ior_into (op1, op2);
|
bitmap_ior_into (op1, op2);
|
}
|
}
|
|
|
|
|
/* Transfer function. */
|
/* Transfer function. */
|
|
|
static bool
|
static bool
|
df_urec_transfer_function (struct dataflow *dflow, int bb_index)
|
df_urec_transfer_function (struct dataflow *dflow, int bb_index)
|
{
|
{
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb_index);
|
bitmap in = bb_info->in;
|
bitmap in = bb_info->in;
|
bitmap out = bb_info->out;
|
bitmap out = bb_info->out;
|
bitmap gen = bb_info->gen;
|
bitmap gen = bb_info->gen;
|
bitmap kill = bb_info->kill;
|
bitmap kill = bb_info->kill;
|
|
|
return bitmap_ior_and_compl (out, gen, in, kill);
|
return bitmap_ior_and_compl (out, gen, in, kill);
|
}
|
}
|
|
|
|
|
/* Free all storage associated with the problem. */
|
/* Free all storage associated with the problem. */
|
|
|
static void
|
static void
|
df_urec_free (struct dataflow *dflow)
|
df_urec_free (struct dataflow *dflow)
|
{
|
{
|
if (dflow->block_info)
|
if (dflow->block_info)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
|
|
for (i = 0; i < dflow->block_info_size; i++)
|
for (i = 0; i < dflow->block_info_size; i++)
|
{
|
{
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, i);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, i);
|
if (bb_info)
|
if (bb_info)
|
{
|
{
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->gen);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->kill);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->in);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->out);
|
BITMAP_FREE (bb_info->earlyclobber);
|
BITMAP_FREE (bb_info->earlyclobber);
|
}
|
}
|
}
|
}
|
|
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
|
|
dflow->block_info_size = 0;
|
dflow->block_info_size = 0;
|
free (dflow->block_info);
|
free (dflow->block_info);
|
free (dflow->problem_data);
|
free (dflow->problem_data);
|
}
|
}
|
free (dflow);
|
free (dflow);
|
}
|
}
|
|
|
|
|
/* Debugging info. */
|
/* Debugging info. */
|
|
|
static void
|
static void
|
df_urec_dump (struct dataflow *dflow, FILE *file)
|
df_urec_dump (struct dataflow *dflow, FILE *file)
|
{
|
{
|
basic_block bb;
|
basic_block bb;
|
|
|
if (!dflow->block_info)
|
if (!dflow->block_info)
|
return;
|
return;
|
|
|
fprintf (file, "Undefined regs:\n");
|
fprintf (file, "Undefined regs:\n");
|
|
|
FOR_ALL_BB (bb)
|
FOR_ALL_BB (bb)
|
{
|
{
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb->index);
|
struct df_urec_bb_info *bb_info = df_urec_get_bb_info (dflow, bb->index);
|
df_print_bb_index (bb, file);
|
df_print_bb_index (bb, file);
|
|
|
if (!bb_info->in)
|
if (!bb_info->in)
|
continue;
|
continue;
|
|
|
fprintf (file, " in \t");
|
fprintf (file, " in \t");
|
dump_bitmap (file, bb_info->in);
|
dump_bitmap (file, bb_info->in);
|
fprintf (file, " gen \t");
|
fprintf (file, " gen \t");
|
dump_bitmap (file, bb_info->gen);
|
dump_bitmap (file, bb_info->gen);
|
fprintf (file, " kill\t");
|
fprintf (file, " kill\t");
|
dump_bitmap (file, bb_info->kill);
|
dump_bitmap (file, bb_info->kill);
|
fprintf (file, " ec\t");
|
fprintf (file, " ec\t");
|
dump_bitmap (file, bb_info->earlyclobber);
|
dump_bitmap (file, bb_info->earlyclobber);
|
fprintf (file, " out \t");
|
fprintf (file, " out \t");
|
dump_bitmap (file, bb_info->out);
|
dump_bitmap (file, bb_info->out);
|
}
|
}
|
}
|
}
|
|
|
/* All of the information associated with every instance of the problem. */
|
/* All of the information associated with every instance of the problem. */
|
|
|
static struct df_problem problem_UREC =
|
static struct df_problem problem_UREC =
|
{
|
{
|
DF_UREC, /* Problem id. */
|
DF_UREC, /* Problem id. */
|
DF_FORWARD, /* Direction. */
|
DF_FORWARD, /* Direction. */
|
df_urec_alloc, /* Allocate the problem specific data. */
|
df_urec_alloc, /* Allocate the problem specific data. */
|
NULL, /* Reset global information. */
|
NULL, /* Reset global information. */
|
df_urec_free_bb_info, /* Free basic block info. */
|
df_urec_free_bb_info, /* Free basic block info. */
|
df_urec_local_compute, /* Local compute function. */
|
df_urec_local_compute, /* Local compute function. */
|
df_urec_init, /* Init the solution specific data. */
|
df_urec_init, /* Init the solution specific data. */
|
df_iterative_dataflow, /* Iterative solver. */
|
df_iterative_dataflow, /* Iterative solver. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator 0. */
|
df_urec_confluence_n, /* Confluence operator n. */
|
df_urec_confluence_n, /* Confluence operator n. */
|
df_urec_transfer_function, /* Transfer function. */
|
df_urec_transfer_function, /* Transfer function. */
|
df_urec_local_finalize, /* Finalize function. */
|
df_urec_local_finalize, /* Finalize function. */
|
df_urec_free, /* Free all of the problem information. */
|
df_urec_free, /* Free all of the problem information. */
|
df_urec_dump, /* Debugging. */
|
df_urec_dump, /* Debugging. */
|
df_lr_add_problem, /* Dependent problem. */
|
df_lr_add_problem, /* Dependent problem. */
|
0 /* Changeable flags. */
|
0 /* Changeable flags. */
|
};
|
};
|
|
|
|
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
of DF. The returned structure is what is used to get at the
|
of DF. The returned structure is what is used to get at the
|
solution. */
|
solution. */
|
|
|
struct dataflow *
|
struct dataflow *
|
df_urec_add_problem (struct df *df, int flags)
|
df_urec_add_problem (struct df *df, int flags)
|
{
|
{
|
return df_add_problem (df, &problem_UREC, flags);
|
return df_add_problem (df, &problem_UREC, flags);
|
}
|
}
|
|
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
CREATE DEF_USE (DU) and / or USE_DEF (UD) CHAINS
|
CREATE DEF_USE (DU) and / or USE_DEF (UD) CHAINS
|
|
|
Link either the defs to the uses and / or the uses to the defs.
|
Link either the defs to the uses and / or the uses to the defs.
|
|
|
These problems are set up like the other dataflow problems so that
|
These problems are set up like the other dataflow problems so that
|
they nicely fit into the framework. They are much simpler and only
|
they nicely fit into the framework. They are much simpler and only
|
involve a single traversal of instructions and an examination of
|
involve a single traversal of instructions and an examination of
|
the reaching defs information (the dependent problem).
|
the reaching defs information (the dependent problem).
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
/* Create def-use or use-def chains. */
|
/* Create def-use or use-def chains. */
|
|
|
static void
|
static void
|
df_chain_alloc (struct dataflow *dflow,
|
df_chain_alloc (struct dataflow *dflow,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
|
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
unsigned int i;
|
unsigned int i;
|
|
|
/* Wholesale destruction of the old chains. */
|
/* Wholesale destruction of the old chains. */
|
if (dflow->block_pool)
|
if (dflow->block_pool)
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
|
|
dflow->block_pool = create_alloc_pool ("df_chain_chain_block pool",
|
dflow->block_pool = create_alloc_pool ("df_chain_chain_block pool",
|
sizeof (struct df_link), 100);
|
sizeof (struct df_link), 100);
|
|
|
if (dflow->flags & DF_DU_CHAIN)
|
if (dflow->flags & DF_DU_CHAIN)
|
{
|
{
|
if (!df->def_info.refs_organized)
|
if (!df->def_info.refs_organized)
|
df_reorganize_refs (&df->def_info);
|
df_reorganize_refs (&df->def_info);
|
|
|
/* Clear out the pointers from the refs. */
|
/* Clear out the pointers from the refs. */
|
for (i = 0; i < DF_DEFS_SIZE (df); i++)
|
for (i = 0; i < DF_DEFS_SIZE (df); i++)
|
{
|
{
|
struct df_ref *ref = df->def_info.refs[i];
|
struct df_ref *ref = df->def_info.refs[i];
|
DF_REF_CHAIN (ref) = NULL;
|
DF_REF_CHAIN (ref) = NULL;
|
}
|
}
|
}
|
}
|
|
|
if (dflow->flags & DF_UD_CHAIN)
|
if (dflow->flags & DF_UD_CHAIN)
|
{
|
{
|
if (!df->use_info.refs_organized)
|
if (!df->use_info.refs_organized)
|
df_reorganize_refs (&df->use_info);
|
df_reorganize_refs (&df->use_info);
|
for (i = 0; i < DF_USES_SIZE (df); i++)
|
for (i = 0; i < DF_USES_SIZE (df); i++)
|
{
|
{
|
struct df_ref *ref = df->use_info.refs[i];
|
struct df_ref *ref = df->use_info.refs[i];
|
DF_REF_CHAIN (ref) = NULL;
|
DF_REF_CHAIN (ref) = NULL;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Reset all def_use and use_def chains in INSN. */
|
/* Reset all def_use and use_def chains in INSN. */
|
|
|
static void
|
static void
|
df_chain_insn_reset (struct dataflow *dflow, rtx insn)
|
df_chain_insn_reset (struct dataflow *dflow, rtx insn)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
unsigned int uid = INSN_UID (insn);
|
unsigned int uid = INSN_UID (insn);
|
struct df_insn_info *insn_info = NULL;
|
struct df_insn_info *insn_info = NULL;
|
struct df_ref *ref;
|
struct df_ref *ref;
|
|
|
if (uid < df->insns_size)
|
if (uid < df->insns_size)
|
insn_info = DF_INSN_UID_GET (df, uid);
|
insn_info = DF_INSN_UID_GET (df, uid);
|
|
|
if (insn_info)
|
if (insn_info)
|
{
|
{
|
if (dflow->flags & DF_DU_CHAIN)
|
if (dflow->flags & DF_DU_CHAIN)
|
{
|
{
|
ref = insn_info->defs;
|
ref = insn_info->defs;
|
while (ref)
|
while (ref)
|
{
|
{
|
ref->chain = NULL;
|
ref->chain = NULL;
|
ref = ref->next_ref;
|
ref = ref->next_ref;
|
}
|
}
|
}
|
}
|
|
|
if (dflow->flags & DF_UD_CHAIN)
|
if (dflow->flags & DF_UD_CHAIN)
|
{
|
{
|
ref = insn_info->uses;
|
ref = insn_info->uses;
|
while (ref)
|
while (ref)
|
{
|
{
|
ref->chain = NULL;
|
ref->chain = NULL;
|
ref = ref->next_ref;
|
ref = ref->next_ref;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Reset all def_use and use_def chains in basic block. */
|
/* Reset all def_use and use_def chains in basic block. */
|
|
|
static void
|
static void
|
df_chain_bb_reset (struct dataflow *dflow, unsigned int bb_index)
|
df_chain_bb_reset (struct dataflow *dflow, unsigned int bb_index)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
rtx insn;
|
rtx insn;
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
|
|
/* Some one deleted the basic block out from under us. */
|
/* Some one deleted the basic block out from under us. */
|
if (!bb)
|
if (!bb)
|
return;
|
return;
|
|
|
FOR_BB_INSNS (bb, insn)
|
FOR_BB_INSNS (bb, insn)
|
{
|
{
|
if (INSN_P (insn))
|
if (INSN_P (insn))
|
{
|
{
|
/* Record defs within INSN. */
|
/* Record defs within INSN. */
|
df_chain_insn_reset (dflow, insn);
|
df_chain_insn_reset (dflow, insn);
|
}
|
}
|
}
|
}
|
|
|
/* Get rid of any chains in artificial uses or defs. */
|
/* Get rid of any chains in artificial uses or defs. */
|
if (dflow->flags & DF_DU_CHAIN)
|
if (dflow->flags & DF_DU_CHAIN)
|
{
|
{
|
struct df_ref *def;
|
struct df_ref *def;
|
def = df_get_artificial_defs (df, bb_index);
|
def = df_get_artificial_defs (df, bb_index);
|
while (def)
|
while (def)
|
{
|
{
|
def->chain = NULL;
|
def->chain = NULL;
|
def = def->next_ref;
|
def = def->next_ref;
|
}
|
}
|
}
|
}
|
|
|
if (dflow->flags & DF_UD_CHAIN)
|
if (dflow->flags & DF_UD_CHAIN)
|
{
|
{
|
struct df_ref *use;
|
struct df_ref *use;
|
use = df_get_artificial_uses (df, bb_index);
|
use = df_get_artificial_uses (df, bb_index);
|
while (use)
|
while (use)
|
{
|
{
|
use->chain = NULL;
|
use->chain = NULL;
|
use = use->next_ref;
|
use = use->next_ref;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Reset all of the chains when the set of basic blocks changes. */
|
/* Reset all of the chains when the set of basic blocks changes. */
|
|
|
|
|
static void
|
static void
|
df_chain_reset (struct dataflow *dflow, bitmap blocks_to_clear)
|
df_chain_reset (struct dataflow *dflow, bitmap blocks_to_clear)
|
{
|
{
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int bb_index;
|
unsigned int bb_index;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_clear, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_clear, 0, bb_index, bi)
|
{
|
{
|
df_chain_bb_reset (dflow, bb_index);
|
df_chain_bb_reset (dflow, bb_index);
|
}
|
}
|
|
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
dflow->block_pool = NULL;
|
dflow->block_pool = NULL;
|
}
|
}
|
|
|
|
|
/* Create the chains for a list of USEs. */
|
/* Create the chains for a list of USEs. */
|
|
|
static void
|
static void
|
df_chain_create_bb_process_use (struct dataflow *dflow,
|
df_chain_create_bb_process_use (struct dataflow *dflow,
|
bitmap local_rd,
|
bitmap local_rd,
|
struct df_ref *use,
|
struct df_ref *use,
|
enum df_ref_flags top_flag)
|
enum df_ref_flags top_flag)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int def_index;
|
unsigned int def_index;
|
|
|
while (use)
|
while (use)
|
{
|
{
|
/* Do not want to go through this for an uninitialized var. */
|
/* Do not want to go through this for an uninitialized var. */
|
unsigned int uregno = DF_REF_REGNO (use);
|
unsigned int uregno = DF_REF_REGNO (use);
|
int count = DF_REG_DEF_GET (df, uregno)->n_refs;
|
int count = DF_REG_DEF_GET (df, uregno)->n_refs;
|
if (count)
|
if (count)
|
{
|
{
|
if (top_flag == (DF_REF_FLAGS (use) & DF_REF_AT_TOP))
|
if (top_flag == (DF_REF_FLAGS (use) & DF_REF_AT_TOP))
|
{
|
{
|
unsigned int first_index = DF_REG_DEF_GET (df, uregno)->begin;
|
unsigned int first_index = DF_REG_DEF_GET (df, uregno)->begin;
|
unsigned int last_index = first_index + count - 1;
|
unsigned int last_index = first_index + count - 1;
|
|
|
EXECUTE_IF_SET_IN_BITMAP (local_rd, first_index, def_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (local_rd, first_index, def_index, bi)
|
{
|
{
|
struct df_ref *def;
|
struct df_ref *def;
|
if (def_index > last_index)
|
if (def_index > last_index)
|
break;
|
break;
|
|
|
def = DF_DEFS_GET (df, def_index);
|
def = DF_DEFS_GET (df, def_index);
|
if (dflow->flags & DF_DU_CHAIN)
|
if (dflow->flags & DF_DU_CHAIN)
|
df_chain_create (dflow, def, use);
|
df_chain_create (dflow, def, use);
|
if (dflow->flags & DF_UD_CHAIN)
|
if (dflow->flags & DF_UD_CHAIN)
|
df_chain_create (dflow, use, def);
|
df_chain_create (dflow, use, def);
|
}
|
}
|
}
|
}
|
}
|
}
|
use = use->next_ref;
|
use = use->next_ref;
|
}
|
}
|
}
|
}
|
|
|
/* Reset the storage pool that the def-use or use-def chains have been
|
/* Reset the storage pool that the def-use or use-def chains have been
|
allocated in. We do not need to re adjust the pointers in the refs,
|
allocated in. We do not need to re adjust the pointers in the refs,
|
these have already been clean out.*/
|
these have already been clean out.*/
|
|
|
/* Create chains from reaching defs bitmaps for basic block BB. */
|
/* Create chains from reaching defs bitmaps for basic block BB. */
|
static void
|
static void
|
df_chain_create_bb (struct dataflow *dflow,
|
df_chain_create_bb (struct dataflow *dflow,
|
struct dataflow *rd_dflow,
|
struct dataflow *rd_dflow,
|
unsigned int bb_index)
|
unsigned int bb_index)
|
{
|
{
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (rd_dflow, bb_index);
|
struct df_rd_bb_info *bb_info = df_rd_get_bb_info (rd_dflow, bb_index);
|
rtx insn;
|
rtx insn;
|
bitmap cpy = BITMAP_ALLOC (NULL);
|
bitmap cpy = BITMAP_ALLOC (NULL);
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
struct df_ref *def;
|
struct df_ref *def;
|
|
|
bitmap_copy (cpy, bb_info->in);
|
bitmap_copy (cpy, bb_info->in);
|
|
|
/* Since we are going forwards, process the artificial uses first
|
/* Since we are going forwards, process the artificial uses first
|
then the artificial defs second. */
|
then the artificial defs second. */
|
|
|
#ifdef EH_USES
|
#ifdef EH_USES
|
/* Create the chains for the artificial uses from the EH_USES at the
|
/* Create the chains for the artificial uses from the EH_USES at the
|
beginning of the block. */
|
beginning of the block. */
|
df_chain_create_bb_process_use (dflow, cpy,
|
df_chain_create_bb_process_use (dflow, cpy,
|
df_get_artificial_uses (df, bb->index),
|
df_get_artificial_uses (df, bb->index),
|
DF_REF_AT_TOP);
|
DF_REF_AT_TOP);
|
#endif
|
#endif
|
|
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if (DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
if (DF_REF_FLAGS (def) & DF_REF_AT_TOP)
|
{
|
{
|
unsigned int dregno = DF_REF_REGNO (def);
|
unsigned int dregno = DF_REF_REGNO (def);
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
bitmap_clear_range (cpy,
|
bitmap_clear_range (cpy,
|
DF_REG_DEF_GET (df, dregno)->begin,
|
DF_REG_DEF_GET (df, dregno)->begin,
|
DF_REG_DEF_GET (df, dregno)->n_refs);
|
DF_REG_DEF_GET (df, dregno)->n_refs);
|
bitmap_set_bit (cpy, DF_REF_ID (def));
|
bitmap_set_bit (cpy, DF_REF_ID (def));
|
}
|
}
|
|
|
/* Process the regular instructions next. */
|
/* Process the regular instructions next. */
|
FOR_BB_INSNS (bb, insn)
|
FOR_BB_INSNS (bb, insn)
|
{
|
{
|
struct df_ref *def;
|
struct df_ref *def;
|
unsigned int uid = INSN_UID (insn);
|
unsigned int uid = INSN_UID (insn);
|
|
|
if (!INSN_P (insn))
|
if (!INSN_P (insn))
|
continue;
|
continue;
|
|
|
/* Now scan the uses and link them up with the defs that remain
|
/* Now scan the uses and link them up with the defs that remain
|
in the cpy vector. */
|
in the cpy vector. */
|
|
|
df_chain_create_bb_process_use (dflow, cpy,
|
df_chain_create_bb_process_use (dflow, cpy,
|
DF_INSN_UID_USES (df, uid), 0);
|
DF_INSN_UID_USES (df, uid), 0);
|
|
|
/* Since we are going forwards, process the defs second. This
|
/* Since we are going forwards, process the defs second. This
|
pass only changes the bits in cpy. */
|
pass only changes the bits in cpy. */
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
{
|
{
|
unsigned int dregno = DF_REF_REGNO (def);
|
unsigned int dregno = DF_REF_REGNO (def);
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
bitmap_clear_range (cpy,
|
bitmap_clear_range (cpy,
|
DF_REG_DEF_GET (df, dregno)->begin,
|
DF_REG_DEF_GET (df, dregno)->begin,
|
DF_REG_DEF_GET (df, dregno)->n_refs);
|
DF_REG_DEF_GET (df, dregno)->n_refs);
|
if (!(DF_REF_FLAGS (def)
|
if (!(DF_REF_FLAGS (def)
|
& (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER)))
|
& (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER)))
|
bitmap_set_bit (cpy, DF_REF_ID (def));
|
bitmap_set_bit (cpy, DF_REF_ID (def));
|
}
|
}
|
}
|
}
|
|
|
/* Create the chains for the artificial uses of the hard registers
|
/* Create the chains for the artificial uses of the hard registers
|
at the end of the block. */
|
at the end of the block. */
|
df_chain_create_bb_process_use (dflow, cpy,
|
df_chain_create_bb_process_use (dflow, cpy,
|
df_get_artificial_uses (df, bb->index), 0);
|
df_get_artificial_uses (df, bb->index), 0);
|
}
|
}
|
|
|
/* Create def-use chains from reaching use bitmaps for basic blocks
|
/* Create def-use chains from reaching use bitmaps for basic blocks
|
in BLOCKS. */
|
in BLOCKS. */
|
|
|
static void
|
static void
|
df_chain_finalize (struct dataflow *dflow, bitmap all_blocks)
|
df_chain_finalize (struct dataflow *dflow, bitmap all_blocks)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
struct dataflow *rd_dflow = df->problems_by_index [DF_RD];
|
struct dataflow *rd_dflow = df->problems_by_index [DF_RD];
|
|
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (all_blocks, 0, bb_index, bi)
|
{
|
{
|
df_chain_create_bb (dflow, rd_dflow, bb_index);
|
df_chain_create_bb (dflow, rd_dflow, bb_index);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Free all storage associated with the problem. */
|
/* Free all storage associated with the problem. */
|
|
|
static void
|
static void
|
df_chain_free (struct dataflow *dflow)
|
df_chain_free (struct dataflow *dflow)
|
{
|
{
|
free_alloc_pool (dflow->block_pool);
|
free_alloc_pool (dflow->block_pool);
|
free (dflow);
|
free (dflow);
|
}
|
}
|
|
|
|
|
/* Debugging info. */
|
/* Debugging info. */
|
|
|
static void
|
static void
|
df_chains_dump (struct dataflow *dflow, FILE *file)
|
df_chains_dump (struct dataflow *dflow, FILE *file)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
unsigned int j;
|
unsigned int j;
|
|
|
if (dflow->flags & DF_DU_CHAIN)
|
if (dflow->flags & DF_DU_CHAIN)
|
{
|
{
|
fprintf (file, "Def-use chains:\n");
|
fprintf (file, "Def-use chains:\n");
|
for (j = 0; j < df->def_info.bitmap_size; j++)
|
for (j = 0; j < df->def_info.bitmap_size; j++)
|
{
|
{
|
struct df_ref *def = DF_DEFS_GET (df, j);
|
struct df_ref *def = DF_DEFS_GET (df, j);
|
if (def)
|
if (def)
|
{
|
{
|
fprintf (file, "d%d bb %d luid %d insn %d reg %d ",
|
fprintf (file, "d%d bb %d luid %d insn %d reg %d ",
|
j, DF_REF_BBNO (def),
|
j, DF_REF_BBNO (def),
|
DF_REF_INSN (def) ?
|
DF_REF_INSN (def) ?
|
DF_INSN_LUID (df, DF_REF_INSN (def)):
|
DF_INSN_LUID (df, DF_REF_INSN (def)):
|
-1,
|
-1,
|
DF_REF_INSN (def) ? DF_REF_INSN_UID (def) : -1,
|
DF_REF_INSN (def) ? DF_REF_INSN_UID (def) : -1,
|
DF_REF_REGNO (def));
|
DF_REF_REGNO (def));
|
if (def->flags & DF_REF_READ_WRITE)
|
if (def->flags & DF_REF_READ_WRITE)
|
fprintf (file, "read/write ");
|
fprintf (file, "read/write ");
|
df_chain_dump (DF_REF_CHAIN (def), file);
|
df_chain_dump (DF_REF_CHAIN (def), file);
|
fprintf (file, "\n");
|
fprintf (file, "\n");
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
if (dflow->flags & DF_UD_CHAIN)
|
if (dflow->flags & DF_UD_CHAIN)
|
{
|
{
|
fprintf (file, "Use-def chains:\n");
|
fprintf (file, "Use-def chains:\n");
|
for (j = 0; j < df->use_info.bitmap_size; j++)
|
for (j = 0; j < df->use_info.bitmap_size; j++)
|
{
|
{
|
struct df_ref *use = DF_USES_GET (df, j);
|
struct df_ref *use = DF_USES_GET (df, j);
|
if (use)
|
if (use)
|
{
|
{
|
fprintf (file, "u%d bb %d luid %d insn %d reg %d ",
|
fprintf (file, "u%d bb %d luid %d insn %d reg %d ",
|
j, DF_REF_BBNO (use),
|
j, DF_REF_BBNO (use),
|
DF_REF_INSN (use) ?
|
DF_REF_INSN (use) ?
|
DF_INSN_LUID (df, DF_REF_INSN (use))
|
DF_INSN_LUID (df, DF_REF_INSN (use))
|
: -1,
|
: -1,
|
DF_REF_INSN (DF_USES_GET (df, j)) ?
|
DF_REF_INSN (DF_USES_GET (df, j)) ?
|
DF_REF_INSN_UID (DF_USES_GET (df,j))
|
DF_REF_INSN_UID (DF_USES_GET (df,j))
|
: -1,
|
: -1,
|
DF_REF_REGNO (use));
|
DF_REF_REGNO (use));
|
if (use->flags & DF_REF_READ_WRITE)
|
if (use->flags & DF_REF_READ_WRITE)
|
fprintf (file, "read/write ");
|
fprintf (file, "read/write ");
|
if (use->flags & DF_REF_STRIPPED)
|
if (use->flags & DF_REF_STRIPPED)
|
fprintf (file, "stripped ");
|
fprintf (file, "stripped ");
|
if (use->flags & DF_REF_IN_NOTE)
|
if (use->flags & DF_REF_IN_NOTE)
|
fprintf (file, "note ");
|
fprintf (file, "note ");
|
df_chain_dump (DF_REF_CHAIN (use), file);
|
df_chain_dump (DF_REF_CHAIN (use), file);
|
fprintf (file, "\n");
|
fprintf (file, "\n");
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
static struct df_problem problem_CHAIN =
|
static struct df_problem problem_CHAIN =
|
{
|
{
|
DF_CHAIN, /* Problem id. */
|
DF_CHAIN, /* Problem id. */
|
DF_NONE, /* Direction. */
|
DF_NONE, /* Direction. */
|
df_chain_alloc, /* Allocate the problem specific data. */
|
df_chain_alloc, /* Allocate the problem specific data. */
|
df_chain_reset, /* Reset global information. */
|
df_chain_reset, /* Reset global information. */
|
NULL, /* Free basic block info. */
|
NULL, /* Free basic block info. */
|
NULL, /* Local compute function. */
|
NULL, /* Local compute function. */
|
NULL, /* Init the solution specific data. */
|
NULL, /* Init the solution specific data. */
|
NULL, /* Iterative solver. */
|
NULL, /* Iterative solver. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator n. */
|
NULL, /* Confluence operator n. */
|
NULL, /* Transfer function. */
|
NULL, /* Transfer function. */
|
df_chain_finalize, /* Finalize function. */
|
df_chain_finalize, /* Finalize function. */
|
df_chain_free, /* Free all of the problem information. */
|
df_chain_free, /* Free all of the problem information. */
|
df_chains_dump, /* Debugging. */
|
df_chains_dump, /* Debugging. */
|
df_rd_add_problem, /* Dependent problem. */
|
df_rd_add_problem, /* Dependent problem. */
|
0 /* Changeable flags. */
|
0 /* Changeable flags. */
|
};
|
};
|
|
|
|
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
of DF. The returned structure is what is used to get at the
|
of DF. The returned structure is what is used to get at the
|
solution. */
|
solution. */
|
|
|
struct dataflow *
|
struct dataflow *
|
df_chain_add_problem (struct df *df, int flags)
|
df_chain_add_problem (struct df *df, int flags)
|
{
|
{
|
return df_add_problem (df, &problem_CHAIN, flags);
|
return df_add_problem (df, &problem_CHAIN, flags);
|
}
|
}
|
|
|
|
|
/*----------------------------------------------------------------------------
|
/*----------------------------------------------------------------------------
|
REGISTER INFORMATION
|
REGISTER INFORMATION
|
|
|
This pass properly computes REG_DEAD and REG_UNUSED notes.
|
This pass properly computes REG_DEAD and REG_UNUSED notes.
|
|
|
If the DF_RI_LIFE flag is set the following vectors containing
|
If the DF_RI_LIFE flag is set the following vectors containing
|
information about register usage are properly set: REG_N_REFS,
|
information about register usage are properly set: REG_N_REFS,
|
REG_N_DEATHS, REG_N_SETS, REG_LIVE_LENGTH, REG_N_CALLS_CROSSED,
|
REG_N_DEATHS, REG_N_SETS, REG_LIVE_LENGTH, REG_N_CALLS_CROSSED,
|
REG_N_THROWING_CALLS_CROSSED and REG_BASIC_BLOCK.
|
REG_N_THROWING_CALLS_CROSSED and REG_BASIC_BLOCK.
|
|
|
----------------------------------------------------------------------------*/
|
----------------------------------------------------------------------------*/
|
|
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
static void
|
static void
|
print_note (char *prefix, rtx insn, rtx note)
|
print_note (char *prefix, rtx insn, rtx note)
|
{
|
{
|
fprintf (stderr, "%s %d ", prefix, INSN_UID (insn));
|
fprintf (stderr, "%s %d ", prefix, INSN_UID (insn));
|
print_rtl (stderr, note);
|
print_rtl (stderr, note);
|
fprintf (stderr, "\n");
|
fprintf (stderr, "\n");
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Allocate the lifetime information. */
|
/* Allocate the lifetime information. */
|
|
|
static void
|
static void
|
df_ri_alloc (struct dataflow *dflow,
|
df_ri_alloc (struct dataflow *dflow,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap blocks_to_rescan ATTRIBUTE_UNUSED,
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
bitmap all_blocks ATTRIBUTE_UNUSED)
|
{
|
{
|
int i;
|
int i;
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
|
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
max_regno = max_reg_num ();
|
max_regno = max_reg_num ();
|
allocate_reg_info (max_regno, FALSE, FALSE);
|
allocate_reg_info (max_regno, FALSE, FALSE);
|
|
|
/* Reset all the data we'll collect. */
|
/* Reset all the data we'll collect. */
|
for (i = 0; i < max_regno; i++)
|
for (i = 0; i < max_regno; i++)
|
{
|
{
|
REG_N_SETS (i) = DF_REG_DEF_COUNT (df, i);
|
REG_N_SETS (i) = DF_REG_DEF_COUNT (df, i);
|
REG_N_REFS (i) = DF_REG_USE_COUNT (df, i) + REG_N_SETS (i);
|
REG_N_REFS (i) = DF_REG_USE_COUNT (df, i) + REG_N_SETS (i);
|
REG_N_DEATHS (i) = 0;
|
REG_N_DEATHS (i) = 0;
|
REG_N_CALLS_CROSSED (i) = 0;
|
REG_N_CALLS_CROSSED (i) = 0;
|
REG_N_THROWING_CALLS_CROSSED (i) = 0;
|
REG_N_THROWING_CALLS_CROSSED (i) = 0;
|
REG_LIVE_LENGTH (i) = 0;
|
REG_LIVE_LENGTH (i) = 0;
|
REG_FREQ (i) = 0;
|
REG_FREQ (i) = 0;
|
REG_BASIC_BLOCK (i) = REG_BLOCK_UNKNOWN;
|
REG_BASIC_BLOCK (i) = REG_BLOCK_UNKNOWN;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* After reg-stack, the x86 floating point stack regs are difficult to
|
/* After reg-stack, the x86 floating point stack regs are difficult to
|
analyze because of all of the pushes, pops and rotations. Thus, we
|
analyze because of all of the pushes, pops and rotations. Thus, we
|
just leave the notes alone. */
|
just leave the notes alone. */
|
|
|
static inline bool
|
static inline bool
|
df_ignore_stack_reg (int regno ATTRIBUTE_UNUSED)
|
df_ignore_stack_reg (int regno ATTRIBUTE_UNUSED)
|
{
|
{
|
#ifdef STACK_REGS
|
#ifdef STACK_REGS
|
return (regstack_completed
|
return (regstack_completed
|
&& IN_RANGE (regno, FIRST_STACK_REG, LAST_STACK_REG));
|
&& IN_RANGE (regno, FIRST_STACK_REG, LAST_STACK_REG));
|
#else
|
#else
|
return false;
|
return false;
|
#endif
|
#endif
|
}
|
}
|
|
|
|
|
/* Remove all of the REG_DEAD or REG_UNUSED notes from INSN. */
|
/* Remove all of the REG_DEAD or REG_UNUSED notes from INSN. */
|
|
|
static void
|
static void
|
df_kill_notes (rtx insn, int flags)
|
df_kill_notes (rtx insn, int flags)
|
{
|
{
|
rtx *pprev = ®_NOTES (insn);
|
rtx *pprev = ®_NOTES (insn);
|
rtx link = *pprev;
|
rtx link = *pprev;
|
|
|
while (link)
|
while (link)
|
{
|
{
|
switch (REG_NOTE_KIND (link))
|
switch (REG_NOTE_KIND (link))
|
{
|
{
|
case REG_DEAD:
|
case REG_DEAD:
|
if (flags & DF_RI_LIFE)
|
if (flags & DF_RI_LIFE)
|
if (df_ignore_stack_reg (REGNO (XEXP (link, 0))))
|
if (df_ignore_stack_reg (REGNO (XEXP (link, 0))))
|
REG_N_DEATHS (REGNO (XEXP (link, 0)))++;
|
REG_N_DEATHS (REGNO (XEXP (link, 0)))++;
|
|
|
/* Fallthru */
|
/* Fallthru */
|
case REG_UNUSED:
|
case REG_UNUSED:
|
if (!df_ignore_stack_reg (REGNO (XEXP (link, 0))))
|
if (!df_ignore_stack_reg (REGNO (XEXP (link, 0))))
|
{
|
{
|
rtx next = XEXP (link, 1);
|
rtx next = XEXP (link, 1);
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
print_note ("deleting: ", insn, link);
|
print_note ("deleting: ", insn, link);
|
#endif
|
#endif
|
free_EXPR_LIST_node (link);
|
free_EXPR_LIST_node (link);
|
*pprev = link = next;
|
*pprev = link = next;
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
pprev = &XEXP (link, 1);
|
pprev = &XEXP (link, 1);
|
link = *pprev;
|
link = *pprev;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Set the REG_UNUSED notes for the multiword hardreg defs in INSN
|
/* Set the REG_UNUSED notes for the multiword hardreg defs in INSN
|
based on the bits in LIVE. Do not generate notes for registers in
|
based on the bits in LIVE. Do not generate notes for registers in
|
artificial uses. DO_NOT_GEN is updated so that REG_DEAD notes are
|
artificial uses. DO_NOT_GEN is updated so that REG_DEAD notes are
|
not generated if the reg is both read and written by the
|
not generated if the reg is both read and written by the
|
instruction.
|
instruction.
|
*/
|
*/
|
|
|
static void
|
static void
|
df_set_unused_notes_for_mw (rtx insn, struct df_mw_hardreg *mws,
|
df_set_unused_notes_for_mw (rtx insn, struct df_mw_hardreg *mws,
|
bitmap live, bitmap do_not_gen,
|
bitmap live, bitmap do_not_gen,
|
bitmap artificial_uses, int flags)
|
bitmap artificial_uses, int flags)
|
{
|
{
|
bool all_dead = true;
|
bool all_dead = true;
|
struct df_link *regs = mws->regs;
|
struct df_link *regs = mws->regs;
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
|
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
fprintf (stderr, "mw unused looking at %d\n", DF_REF_REGNO (regs->ref));
|
fprintf (stderr, "mw unused looking at %d\n", DF_REF_REGNO (regs->ref));
|
df_ref_debug (regs->ref, stderr);
|
df_ref_debug (regs->ref, stderr);
|
#endif
|
#endif
|
while (regs)
|
while (regs)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
if ((bitmap_bit_p (live, regno))
|
if ((bitmap_bit_p (live, regno))
|
|| bitmap_bit_p (artificial_uses, regno))
|
|| bitmap_bit_p (artificial_uses, regno))
|
{
|
{
|
all_dead = false;
|
all_dead = false;
|
break;
|
break;
|
}
|
}
|
regs = regs->next;
|
regs = regs->next;
|
}
|
}
|
|
|
if (all_dead)
|
if (all_dead)
|
{
|
{
|
struct df_link *regs = mws->regs;
|
struct df_link *regs = mws->regs;
|
rtx note = alloc_EXPR_LIST (REG_UNUSED, *DF_REF_LOC (regs->ref),
|
rtx note = alloc_EXPR_LIST (REG_UNUSED, *DF_REF_LOC (regs->ref),
|
REG_NOTES (insn));
|
REG_NOTES (insn));
|
REG_NOTES (insn) = note;
|
REG_NOTES (insn) = note;
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
print_note ("adding 1: ", insn, note);
|
print_note ("adding 1: ", insn, note);
|
#endif
|
#endif
|
bitmap_set_bit (do_not_gen, regno);
|
bitmap_set_bit (do_not_gen, regno);
|
/* Only do this if the value is totally dead. */
|
/* Only do this if the value is totally dead. */
|
if (flags & DF_RI_LIFE)
|
if (flags & DF_RI_LIFE)
|
{
|
{
|
REG_N_DEATHS (regno) ++;
|
REG_N_DEATHS (regno) ++;
|
REG_LIVE_LENGTH (regno)++;
|
REG_LIVE_LENGTH (regno)++;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
struct df_link *regs = mws->regs;
|
struct df_link *regs = mws->regs;
|
while (regs)
|
while (regs)
|
{
|
{
|
struct df_ref *ref = regs->ref;
|
struct df_ref *ref = regs->ref;
|
|
|
regno = DF_REF_REGNO (ref);
|
regno = DF_REF_REGNO (ref);
|
if ((!bitmap_bit_p (live, regno))
|
if ((!bitmap_bit_p (live, regno))
|
&& (!bitmap_bit_p (artificial_uses, regno)))
|
&& (!bitmap_bit_p (artificial_uses, regno)))
|
{
|
{
|
rtx note = alloc_EXPR_LIST (REG_UNUSED, regno_reg_rtx[regno],
|
rtx note = alloc_EXPR_LIST (REG_UNUSED, regno_reg_rtx[regno],
|
REG_NOTES (insn));
|
REG_NOTES (insn));
|
REG_NOTES (insn) = note;
|
REG_NOTES (insn) = note;
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
print_note ("adding 2: ", insn, note);
|
print_note ("adding 2: ", insn, note);
|
#endif
|
#endif
|
}
|
}
|
bitmap_set_bit (do_not_gen, regno);
|
bitmap_set_bit (do_not_gen, regno);
|
regs = regs->next;
|
regs = regs->next;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Set the REG_DEAD notes for the multiword hardreg use in INSN based
|
/* Set the REG_DEAD notes for the multiword hardreg use in INSN based
|
on the bits in LIVE. DO_NOT_GEN is used to keep REG_DEAD notes
|
on the bits in LIVE. DO_NOT_GEN is used to keep REG_DEAD notes
|
from being set if the instruction both reads and writes the
|
from being set if the instruction both reads and writes the
|
register. */
|
register. */
|
|
|
static void
|
static void
|
df_set_dead_notes_for_mw (rtx insn, struct df_mw_hardreg *mws,
|
df_set_dead_notes_for_mw (rtx insn, struct df_mw_hardreg *mws,
|
bitmap live, bitmap do_not_gen,
|
bitmap live, bitmap do_not_gen,
|
bitmap artificial_uses, int flags)
|
bitmap artificial_uses, int flags)
|
{
|
{
|
bool all_dead = true;
|
bool all_dead = true;
|
struct df_link *regs = mws->regs;
|
struct df_link *regs = mws->regs;
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
|
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
fprintf (stderr, "mw looking at %d\n", DF_REF_REGNO (regs->ref));
|
fprintf (stderr, "mw looking at %d\n", DF_REF_REGNO (regs->ref));
|
df_ref_debug (regs->ref, stderr);
|
df_ref_debug (regs->ref, stderr);
|
#endif
|
#endif
|
while (regs)
|
while (regs)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
unsigned int regno = DF_REF_REGNO (regs->ref);
|
if ((bitmap_bit_p (live, regno))
|
if ((bitmap_bit_p (live, regno))
|
|| bitmap_bit_p (artificial_uses, regno))
|
|| bitmap_bit_p (artificial_uses, regno))
|
{
|
{
|
all_dead = false;
|
all_dead = false;
|
break;
|
break;
|
}
|
}
|
regs = regs->next;
|
regs = regs->next;
|
}
|
}
|
|
|
if (all_dead)
|
if (all_dead)
|
{
|
{
|
if (!bitmap_bit_p (do_not_gen, regno))
|
if (!bitmap_bit_p (do_not_gen, regno))
|
{
|
{
|
/* Add a dead note for the entire multi word register. */
|
/* Add a dead note for the entire multi word register. */
|
struct df_link *regs = mws->regs;
|
struct df_link *regs = mws->regs;
|
rtx note = alloc_EXPR_LIST (REG_DEAD, *DF_REF_LOC (regs->ref),
|
rtx note = alloc_EXPR_LIST (REG_DEAD, *DF_REF_LOC (regs->ref),
|
REG_NOTES (insn));
|
REG_NOTES (insn));
|
REG_NOTES (insn) = note;
|
REG_NOTES (insn) = note;
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
print_note ("adding 1: ", insn, note);
|
print_note ("adding 1: ", insn, note);
|
#endif
|
#endif
|
|
|
if (flags & DF_RI_LIFE)
|
if (flags & DF_RI_LIFE)
|
{
|
{
|
struct df_link *regs = mws->regs;
|
struct df_link *regs = mws->regs;
|
while (regs)
|
while (regs)
|
{
|
{
|
struct df_ref *ref = regs->ref;
|
struct df_ref *ref = regs->ref;
|
regno = DF_REF_REGNO (ref);
|
regno = DF_REF_REGNO (ref);
|
REG_N_DEATHS (regno)++;
|
REG_N_DEATHS (regno)++;
|
regs = regs->next;
|
regs = regs->next;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
struct df_link *regs = mws->regs;
|
struct df_link *regs = mws->regs;
|
while (regs)
|
while (regs)
|
{
|
{
|
struct df_ref *ref = regs->ref;
|
struct df_ref *ref = regs->ref;
|
|
|
regno = DF_REF_REGNO (ref);
|
regno = DF_REF_REGNO (ref);
|
if ((!bitmap_bit_p (live, regno))
|
if ((!bitmap_bit_p (live, regno))
|
&& (!bitmap_bit_p (artificial_uses, regno))
|
&& (!bitmap_bit_p (artificial_uses, regno))
|
&& (!bitmap_bit_p (do_not_gen, regno)))
|
&& (!bitmap_bit_p (do_not_gen, regno)))
|
{
|
{
|
rtx note = alloc_EXPR_LIST (REG_DEAD, regno_reg_rtx[regno],
|
rtx note = alloc_EXPR_LIST (REG_DEAD, regno_reg_rtx[regno],
|
REG_NOTES (insn));
|
REG_NOTES (insn));
|
REG_NOTES (insn) = note;
|
REG_NOTES (insn) = note;
|
if (flags & DF_RI_LIFE)
|
if (flags & DF_RI_LIFE)
|
REG_N_DEATHS (regno)++;
|
REG_N_DEATHS (regno)++;
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
print_note ("adding 2: ", insn, note);
|
print_note ("adding 2: ", insn, note);
|
#endif
|
#endif
|
}
|
}
|
|
|
regs = regs->next;
|
regs = regs->next;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Create a REG_UNUSED note if necessary for DEF in INSN updating LIVE
|
/* Create a REG_UNUSED note if necessary for DEF in INSN updating LIVE
|
and DO_NOT_GEN. Do not generate notes for registers in artificial
|
and DO_NOT_GEN. Do not generate notes for registers in artificial
|
uses. */
|
uses. */
|
|
|
static void
|
static void
|
df_create_unused_note (basic_block bb, rtx insn, struct df_ref *def,
|
df_create_unused_note (basic_block bb, rtx insn, struct df_ref *def,
|
bitmap live, bitmap do_not_gen, bitmap artificial_uses,
|
bitmap live, bitmap do_not_gen, bitmap artificial_uses,
|
bitmap local_live, bitmap local_processed,
|
bitmap local_live, bitmap local_processed,
|
int flags, int luid)
|
int flags, int luid)
|
{
|
{
|
unsigned int dregno = DF_REF_REGNO (def);
|
unsigned int dregno = DF_REF_REGNO (def);
|
|
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
fprintf (stderr, " regular looking at def ");
|
fprintf (stderr, " regular looking at def ");
|
df_ref_debug (def, stderr);
|
df_ref_debug (def, stderr);
|
#endif
|
#endif
|
|
|
if (bitmap_bit_p (live, dregno))
|
if (bitmap_bit_p (live, dregno))
|
{
|
{
|
if (flags & DF_RI_LIFE)
|
if (flags & DF_RI_LIFE)
|
{
|
{
|
/* If we have seen this regno, then it has already been
|
/* If we have seen this regno, then it has already been
|
processed correctly with the per insn increment. If we
|
processed correctly with the per insn increment. If we
|
have not seen it we need to add the length from here to
|
have not seen it we need to add the length from here to
|
the end of the block to the live length. */
|
the end of the block to the live length. */
|
if (bitmap_bit_p (local_processed, dregno))
|
if (bitmap_bit_p (local_processed, dregno))
|
{
|
{
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
bitmap_clear_bit (local_live, dregno);
|
bitmap_clear_bit (local_live, dregno);
|
}
|
}
|
else
|
else
|
{
|
{
|
bitmap_set_bit (local_processed, dregno);
|
bitmap_set_bit (local_processed, dregno);
|
REG_LIVE_LENGTH (dregno) += luid;
|
REG_LIVE_LENGTH (dregno) += luid;
|
}
|
}
|
}
|
}
|
}
|
}
|
else if ((!(DF_REF_FLAGS (def) & DF_REF_MW_HARDREG))
|
else if ((!(DF_REF_FLAGS (def) & DF_REF_MW_HARDREG))
|
&& (!bitmap_bit_p (artificial_uses, dregno))
|
&& (!bitmap_bit_p (artificial_uses, dregno))
|
&& (!df_ignore_stack_reg (dregno)))
|
&& (!df_ignore_stack_reg (dregno)))
|
{
|
{
|
rtx reg = GET_CODE (*DF_REF_LOC (def)) == SUBREG ?
|
rtx reg = GET_CODE (*DF_REF_LOC (def)) == SUBREG ?
|
SUBREG_REG (*DF_REF_LOC (def)) : *DF_REF_LOC (def);
|
SUBREG_REG (*DF_REF_LOC (def)) : *DF_REF_LOC (def);
|
rtx note = alloc_EXPR_LIST (REG_UNUSED, reg, REG_NOTES (insn));
|
rtx note = alloc_EXPR_LIST (REG_UNUSED, reg, REG_NOTES (insn));
|
REG_NOTES (insn) = note;
|
REG_NOTES (insn) = note;
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
print_note ("adding 3: ", insn, note);
|
print_note ("adding 3: ", insn, note);
|
#endif
|
#endif
|
if (flags & DF_RI_LIFE)
|
if (flags & DF_RI_LIFE)
|
{
|
{
|
REG_N_DEATHS (dregno) ++;
|
REG_N_DEATHS (dregno) ++;
|
REG_LIVE_LENGTH (dregno)++;
|
REG_LIVE_LENGTH (dregno)++;
|
}
|
}
|
}
|
}
|
|
|
if ((flags & DF_RI_LIFE) && (dregno >= FIRST_PSEUDO_REGISTER))
|
if ((flags & DF_RI_LIFE) && (dregno >= FIRST_PSEUDO_REGISTER))
|
{
|
{
|
REG_FREQ (dregno) += REG_FREQ_FROM_BB (bb);
|
REG_FREQ (dregno) += REG_FREQ_FROM_BB (bb);
|
if (REG_BASIC_BLOCK (dregno) == REG_BLOCK_UNKNOWN)
|
if (REG_BASIC_BLOCK (dregno) == REG_BLOCK_UNKNOWN)
|
REG_BASIC_BLOCK (dregno) = bb->index;
|
REG_BASIC_BLOCK (dregno) = bb->index;
|
else if (REG_BASIC_BLOCK (dregno) != bb->index)
|
else if (REG_BASIC_BLOCK (dregno) != bb->index)
|
REG_BASIC_BLOCK (dregno) = REG_BLOCK_GLOBAL;
|
REG_BASIC_BLOCK (dregno) = REG_BLOCK_GLOBAL;
|
}
|
}
|
|
|
if (!(DF_REF_FLAGS (def) & (DF_REF_MUST_CLOBBER + DF_REF_MAY_CLOBBER)))
|
if (!(DF_REF_FLAGS (def) & (DF_REF_MUST_CLOBBER + DF_REF_MAY_CLOBBER)))
|
bitmap_set_bit (do_not_gen, dregno);
|
bitmap_set_bit (do_not_gen, dregno);
|
|
|
/* Kill this register if it is not a subreg store. */
|
/* Kill this register if it is not a subreg store. */
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
if (!(DF_REF_FLAGS (def) & DF_REF_PARTIAL))
|
bitmap_clear_bit (live, dregno);
|
bitmap_clear_bit (live, dregno);
|
}
|
}
|
|
|
|
|
/* Recompute the REG_DEAD and REG_UNUSED notes and compute register
|
/* Recompute the REG_DEAD and REG_UNUSED notes and compute register
|
info: lifetime, bb, and number of defs and uses for basic block
|
info: lifetime, bb, and number of defs and uses for basic block
|
BB. The three bitvectors are scratch regs used here. */
|
BB. The three bitvectors are scratch regs used here. */
|
|
|
static void
|
static void
|
df_ri_bb_compute (struct dataflow *dflow, unsigned int bb_index,
|
df_ri_bb_compute (struct dataflow *dflow, unsigned int bb_index,
|
bitmap live, bitmap do_not_gen, bitmap artificial_uses,
|
bitmap live, bitmap do_not_gen, bitmap artificial_uses,
|
bitmap local_live, bitmap local_processed, bitmap setjumps_crossed)
|
bitmap local_live, bitmap local_processed, bitmap setjumps_crossed)
|
{
|
{
|
struct df *df = dflow->df;
|
struct df *df = dflow->df;
|
basic_block bb = BASIC_BLOCK (bb_index);
|
basic_block bb = BASIC_BLOCK (bb_index);
|
rtx insn;
|
rtx insn;
|
struct df_ref *def;
|
struct df_ref *def;
|
struct df_ref *use;
|
struct df_ref *use;
|
int luid = 0;
|
int luid = 0;
|
|
|
bitmap_copy (live, df_get_live_out (df, bb));
|
bitmap_copy (live, df_get_live_out (df, bb));
|
bitmap_clear (artificial_uses);
|
bitmap_clear (artificial_uses);
|
|
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
/* Process the regs live at the end of the block. Mark them as
|
/* Process the regs live at the end of the block. Mark them as
|
not local to any one basic block. */
|
not local to any one basic block. */
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
|
REG_BASIC_BLOCK (regno) = REG_BLOCK_GLOBAL;
|
REG_BASIC_BLOCK (regno) = REG_BLOCK_GLOBAL;
|
}
|
}
|
|
|
/* Process the artificial defs and uses at the bottom of the block
|
/* Process the artificial defs and uses at the bottom of the block
|
to begin processing. */
|
to begin processing. */
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
if ((DF_REF_FLAGS (def) & DF_REF_AT_TOP) == 0)
|
bitmap_clear_bit (live, DF_REF_REGNO (def));
|
bitmap_clear_bit (live, DF_REF_REGNO (def));
|
|
|
for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
|
for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
|
if ((DF_REF_FLAGS (use) & DF_REF_AT_TOP) == 0)
|
if ((DF_REF_FLAGS (use) & DF_REF_AT_TOP) == 0)
|
{
|
{
|
unsigned int regno = DF_REF_REGNO (use);
|
unsigned int regno = DF_REF_REGNO (use);
|
bitmap_set_bit (live, regno);
|
bitmap_set_bit (live, regno);
|
|
|
/* Notes are not generated for any of the artificial registers
|
/* Notes are not generated for any of the artificial registers
|
at the bottom of the block. */
|
at the bottom of the block. */
|
bitmap_set_bit (artificial_uses, regno);
|
bitmap_set_bit (artificial_uses, regno);
|
}
|
}
|
|
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
FOR_BB_INSNS_REVERSE (bb, insn)
|
{
|
{
|
unsigned int uid = INSN_UID (insn);
|
unsigned int uid = INSN_UID (insn);
|
unsigned int regno;
|
unsigned int regno;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
struct df_mw_hardreg *mws;
|
struct df_mw_hardreg *mws;
|
|
|
if (!INSN_P (insn))
|
if (!INSN_P (insn))
|
continue;
|
continue;
|
|
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
/* Increment the live_length for all of the registers that
|
/* Increment the live_length for all of the registers that
|
are are referenced in this block and live at this
|
are are referenced in this block and live at this
|
particular point. */
|
particular point. */
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
EXECUTE_IF_SET_IN_BITMAP (local_live, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (local_live, 0, regno, bi)
|
{
|
{
|
REG_LIVE_LENGTH (regno)++;
|
REG_LIVE_LENGTH (regno)++;
|
}
|
}
|
luid++;
|
luid++;
|
}
|
}
|
|
|
bitmap_clear (do_not_gen);
|
bitmap_clear (do_not_gen);
|
df_kill_notes (insn, dflow->flags);
|
df_kill_notes (insn, dflow->flags);
|
|
|
/* Process the defs. */
|
/* Process the defs. */
|
if (CALL_P (insn))
|
if (CALL_P (insn))
|
{
|
{
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
bool can_throw = can_throw_internal (insn);
|
bool can_throw = can_throw_internal (insn);
|
bool set_jump = (find_reg_note (insn, REG_SETJMP, NULL) != NULL);
|
bool set_jump = (find_reg_note (insn, REG_SETJMP, NULL) != NULL);
|
EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
|
{
|
{
|
REG_N_CALLS_CROSSED (regno)++;
|
REG_N_CALLS_CROSSED (regno)++;
|
if (can_throw)
|
if (can_throw)
|
REG_N_THROWING_CALLS_CROSSED (regno)++;
|
REG_N_THROWING_CALLS_CROSSED (regno)++;
|
|
|
/* We have a problem with any pseudoreg that lives
|
/* We have a problem with any pseudoreg that lives
|
across the setjmp. ANSI says that if a user
|
across the setjmp. ANSI says that if a user
|
variable does not change in value between the
|
variable does not change in value between the
|
setjmp and the longjmp, then the longjmp
|
setjmp and the longjmp, then the longjmp
|
preserves it. This includes longjmp from a place
|
preserves it. This includes longjmp from a place
|
where the pseudo appears dead. (In principle,
|
where the pseudo appears dead. (In principle,
|
the value still exists if it is in scope.) If
|
the value still exists if it is in scope.) If
|
the pseudo goes in a hard reg, some other value
|
the pseudo goes in a hard reg, some other value
|
may occupy that hard reg where this pseudo is
|
may occupy that hard reg where this pseudo is
|
dead, thus clobbering the pseudo. Conclusion:
|
dead, thus clobbering the pseudo. Conclusion:
|
such a pseudo must not go in a hard reg. */
|
such a pseudo must not go in a hard reg. */
|
if (set_jump && regno >= FIRST_PSEUDO_REGISTER)
|
if (set_jump && regno >= FIRST_PSEUDO_REGISTER)
|
bitmap_set_bit (setjumps_crossed, regno);
|
bitmap_set_bit (setjumps_crossed, regno);
|
}
|
}
|
}
|
}
|
|
|
/* We only care about real sets for calls. Clobbers only
|
/* We only care about real sets for calls. Clobbers only
|
may clobber and cannot be depended on. */
|
may clobber and cannot be depended on. */
|
for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
|
for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
|
{
|
{
|
if ((mws->type == DF_REF_REG_DEF)
|
if ((mws->type == DF_REF_REG_DEF)
|
&& !df_ignore_stack_reg (REGNO (mws->mw_reg)))
|
&& !df_ignore_stack_reg (REGNO (mws->mw_reg)))
|
df_set_unused_notes_for_mw (insn, mws, live, do_not_gen,
|
df_set_unused_notes_for_mw (insn, mws, live, do_not_gen,
|
artificial_uses, dflow->flags);
|
artificial_uses, dflow->flags);
|
}
|
}
|
|
|
/* All of the defs except the return value are some sort of
|
/* All of the defs except the return value are some sort of
|
clobber. This code is for the return. */
|
clobber. This code is for the return. */
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
if (!(DF_REF_FLAGS (def) & (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER)))
|
if (!(DF_REF_FLAGS (def) & (DF_REF_MUST_CLOBBER | DF_REF_MAY_CLOBBER)))
|
df_create_unused_note (bb, insn, def, live, do_not_gen,
|
df_create_unused_note (bb, insn, def, live, do_not_gen,
|
artificial_uses, local_live,
|
artificial_uses, local_live,
|
local_processed, dflow->flags, luid);
|
local_processed, dflow->flags, luid);
|
|
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Regular insn. */
|
/* Regular insn. */
|
for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
|
for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
|
{
|
{
|
if (mws->type == DF_REF_REG_DEF)
|
if (mws->type == DF_REF_REG_DEF)
|
df_set_unused_notes_for_mw (insn, mws, live, do_not_gen,
|
df_set_unused_notes_for_mw (insn, mws, live, do_not_gen,
|
artificial_uses, dflow->flags);
|
artificial_uses, dflow->flags);
|
}
|
}
|
|
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
|
df_create_unused_note (bb, insn, def, live, do_not_gen,
|
df_create_unused_note (bb, insn, def, live, do_not_gen,
|
artificial_uses, local_live,
|
artificial_uses, local_live,
|
local_processed, dflow->flags, luid);
|
local_processed, dflow->flags, luid);
|
}
|
}
|
|
|
/* Process the uses. */
|
/* Process the uses. */
|
for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
|
for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
|
{
|
{
|
if ((mws->type != DF_REF_REG_DEF)
|
if ((mws->type != DF_REF_REG_DEF)
|
&& !df_ignore_stack_reg (REGNO (mws->mw_reg)))
|
&& !df_ignore_stack_reg (REGNO (mws->mw_reg)))
|
df_set_dead_notes_for_mw (insn, mws, live, do_not_gen,
|
df_set_dead_notes_for_mw (insn, mws, live, do_not_gen,
|
artificial_uses, dflow->flags);
|
artificial_uses, dflow->flags);
|
}
|
}
|
|
|
for (use = DF_INSN_UID_USES (df, uid); use; use = use->next_ref)
|
for (use = DF_INSN_UID_USES (df, uid); use; use = use->next_ref)
|
{
|
{
|
unsigned int uregno = DF_REF_REGNO (use);
|
unsigned int uregno = DF_REF_REGNO (use);
|
|
|
if ((dflow->flags & DF_RI_LIFE) && (uregno >= FIRST_PSEUDO_REGISTER))
|
if ((dflow->flags & DF_RI_LIFE) && (uregno >= FIRST_PSEUDO_REGISTER))
|
{
|
{
|
REG_FREQ (uregno) += REG_FREQ_FROM_BB (bb);
|
REG_FREQ (uregno) += REG_FREQ_FROM_BB (bb);
|
if (REG_BASIC_BLOCK (uregno) == REG_BLOCK_UNKNOWN)
|
if (REG_BASIC_BLOCK (uregno) == REG_BLOCK_UNKNOWN)
|
REG_BASIC_BLOCK (uregno) = bb->index;
|
REG_BASIC_BLOCK (uregno) = bb->index;
|
else if (REG_BASIC_BLOCK (uregno) != bb->index)
|
else if (REG_BASIC_BLOCK (uregno) != bb->index)
|
REG_BASIC_BLOCK (uregno) = REG_BLOCK_GLOBAL;
|
REG_BASIC_BLOCK (uregno) = REG_BLOCK_GLOBAL;
|
}
|
}
|
|
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
fprintf (stderr, " regular looking at use ");
|
fprintf (stderr, " regular looking at use ");
|
df_ref_debug (use, stderr);
|
df_ref_debug (use, stderr);
|
#endif
|
#endif
|
if (!bitmap_bit_p (live, uregno))
|
if (!bitmap_bit_p (live, uregno))
|
{
|
{
|
if ( (!(DF_REF_FLAGS (use) & DF_REF_MW_HARDREG))
|
if ( (!(DF_REF_FLAGS (use) & DF_REF_MW_HARDREG))
|
&& (!bitmap_bit_p (do_not_gen, uregno))
|
&& (!bitmap_bit_p (do_not_gen, uregno))
|
&& (!bitmap_bit_p (artificial_uses, uregno))
|
&& (!bitmap_bit_p (artificial_uses, uregno))
|
&& (!(DF_REF_FLAGS (use) & DF_REF_READ_WRITE))
|
&& (!(DF_REF_FLAGS (use) & DF_REF_READ_WRITE))
|
&& (!df_ignore_stack_reg (uregno)))
|
&& (!df_ignore_stack_reg (uregno)))
|
{
|
{
|
rtx reg = GET_CODE (*DF_REF_LOC (use)) == SUBREG ?
|
rtx reg = GET_CODE (*DF_REF_LOC (use)) == SUBREG ?
|
SUBREG_REG (*DF_REF_LOC (use)) : *DF_REF_LOC (use);
|
SUBREG_REG (*DF_REF_LOC (use)) : *DF_REF_LOC (use);
|
rtx note = alloc_EXPR_LIST (REG_DEAD, reg, REG_NOTES (insn));
|
rtx note = alloc_EXPR_LIST (REG_DEAD, reg, REG_NOTES (insn));
|
REG_NOTES (insn) = note;
|
REG_NOTES (insn) = note;
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
REG_N_DEATHS (uregno)++;
|
REG_N_DEATHS (uregno)++;
|
|
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
print_note ("adding 4: ", insn, note);
|
print_note ("adding 4: ", insn, note);
|
#endif
|
#endif
|
}
|
}
|
/* This register is now live. */
|
/* This register is now live. */
|
bitmap_set_bit (live, uregno);
|
bitmap_set_bit (live, uregno);
|
|
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
/* If we have seen this regno, then it has already
|
/* If we have seen this regno, then it has already
|
been processed correctly with the per insn
|
been processed correctly with the per insn
|
increment. If we have not seen it we set the bit
|
increment. If we have not seen it we set the bit
|
so that begins to get processed locally. Note
|
so that begins to get processed locally. Note
|
that we don't even get here if the variable was
|
that we don't even get here if the variable was
|
live at the end of the block since just a ref
|
live at the end of the block since just a ref
|
inside the block does not effect the
|
inside the block does not effect the
|
calculations. */
|
calculations. */
|
REG_LIVE_LENGTH (uregno) ++;
|
REG_LIVE_LENGTH (uregno) ++;
|
bitmap_set_bit (local_live, uregno);
|
bitmap_set_bit (local_live, uregno);
|
bitmap_set_bit (local_processed, uregno);
|
bitmap_set_bit (local_processed, uregno);
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
/* Add the length of the block to all of the registers that were
|
/* Add the length of the block to all of the registers that were
|
not referenced, but still live in this block. */
|
not referenced, but still live in this block. */
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
bitmap_and_compl_into (live, local_processed);
|
bitmap_and_compl_into (live, local_processed);
|
EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
|
{
|
{
|
REG_LIVE_LENGTH (regno) += luid;
|
REG_LIVE_LENGTH (regno) += luid;
|
}
|
}
|
bitmap_clear (local_processed);
|
bitmap_clear (local_processed);
|
bitmap_clear (local_live);
|
bitmap_clear (local_live);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Compute register info: lifetime, bb, and number of defs and uses. */
|
/* Compute register info: lifetime, bb, and number of defs and uses. */
|
static void
|
static void
|
df_ri_compute (struct dataflow *dflow, bitmap all_blocks ATTRIBUTE_UNUSED,
|
df_ri_compute (struct dataflow *dflow, bitmap all_blocks ATTRIBUTE_UNUSED,
|
bitmap blocks_to_scan)
|
bitmap blocks_to_scan)
|
{
|
{
|
unsigned int bb_index;
|
unsigned int bb_index;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
bitmap live = BITMAP_ALLOC (NULL);
|
bitmap live = BITMAP_ALLOC (NULL);
|
bitmap do_not_gen = BITMAP_ALLOC (NULL);
|
bitmap do_not_gen = BITMAP_ALLOC (NULL);
|
bitmap artificial_uses = BITMAP_ALLOC (NULL);
|
bitmap artificial_uses = BITMAP_ALLOC (NULL);
|
bitmap local_live = NULL;
|
bitmap local_live = NULL;
|
bitmap local_processed = NULL;
|
bitmap local_processed = NULL;
|
bitmap setjumps_crossed = NULL;
|
bitmap setjumps_crossed = NULL;
|
|
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
local_live = BITMAP_ALLOC (NULL);
|
local_live = BITMAP_ALLOC (NULL);
|
local_processed = BITMAP_ALLOC (NULL);
|
local_processed = BITMAP_ALLOC (NULL);
|
setjumps_crossed = BITMAP_ALLOC (NULL);
|
setjumps_crossed = BITMAP_ALLOC (NULL);
|
}
|
}
|
|
|
|
|
#ifdef REG_DEAD_DEBUGGING
|
#ifdef REG_DEAD_DEBUGGING
|
df_lr_dump (dflow->df->problems_by_index [DF_LR], stderr);
|
df_lr_dump (dflow->df->problems_by_index [DF_LR], stderr);
|
print_rtl_with_bb (stderr, get_insns());
|
print_rtl_with_bb (stderr, get_insns());
|
#endif
|
#endif
|
|
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_scan, 0, bb_index, bi)
|
EXECUTE_IF_SET_IN_BITMAP (blocks_to_scan, 0, bb_index, bi)
|
{
|
{
|
df_ri_bb_compute (dflow, bb_index, live, do_not_gen, artificial_uses,
|
df_ri_bb_compute (dflow, bb_index, live, do_not_gen, artificial_uses,
|
local_live, local_processed, setjumps_crossed);
|
local_live, local_processed, setjumps_crossed);
|
}
|
}
|
|
|
BITMAP_FREE (live);
|
BITMAP_FREE (live);
|
BITMAP_FREE (do_not_gen);
|
BITMAP_FREE (do_not_gen);
|
BITMAP_FREE (artificial_uses);
|
BITMAP_FREE (artificial_uses);
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
unsigned int regno;
|
unsigned int regno;
|
/* See the setjump comment in df_ri_bb_compute. */
|
/* See the setjump comment in df_ri_bb_compute. */
|
EXECUTE_IF_SET_IN_BITMAP (setjumps_crossed, 0, regno, bi)
|
EXECUTE_IF_SET_IN_BITMAP (setjumps_crossed, 0, regno, bi)
|
{
|
{
|
REG_BASIC_BLOCK (regno) = REG_BLOCK_UNKNOWN;
|
REG_BASIC_BLOCK (regno) = REG_BLOCK_UNKNOWN;
|
REG_LIVE_LENGTH (regno) = -1;
|
REG_LIVE_LENGTH (regno) = -1;
|
}
|
}
|
|
|
BITMAP_FREE (local_live);
|
BITMAP_FREE (local_live);
|
BITMAP_FREE (local_processed);
|
BITMAP_FREE (local_processed);
|
BITMAP_FREE (setjumps_crossed);
|
BITMAP_FREE (setjumps_crossed);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Free all storage associated with the problem. */
|
/* Free all storage associated with the problem. */
|
|
|
static void
|
static void
|
df_ri_free (struct dataflow *dflow)
|
df_ri_free (struct dataflow *dflow)
|
{
|
{
|
free (dflow->problem_data);
|
free (dflow->problem_data);
|
free (dflow);
|
free (dflow);
|
}
|
}
|
|
|
|
|
/* Debugging info. */
|
/* Debugging info. */
|
|
|
static void
|
static void
|
df_ri_dump (struct dataflow *dflow, FILE *file)
|
df_ri_dump (struct dataflow *dflow, FILE *file)
|
{
|
{
|
print_rtl_with_bb (file, get_insns ());
|
print_rtl_with_bb (file, get_insns ());
|
|
|
if (dflow->flags & DF_RI_LIFE)
|
if (dflow->flags & DF_RI_LIFE)
|
{
|
{
|
fprintf (file, "Register info:\n");
|
fprintf (file, "Register info:\n");
|
dump_flow_info (file, -1);
|
dump_flow_info (file, -1);
|
}
|
}
|
}
|
}
|
|
|
/* All of the information associated every instance of the problem. */
|
/* All of the information associated every instance of the problem. */
|
|
|
static struct df_problem problem_RI =
|
static struct df_problem problem_RI =
|
{
|
{
|
DF_RI, /* Problem id. */
|
DF_RI, /* Problem id. */
|
DF_NONE, /* Direction. */
|
DF_NONE, /* Direction. */
|
df_ri_alloc, /* Allocate the problem specific data. */
|
df_ri_alloc, /* Allocate the problem specific data. */
|
NULL, /* Reset global information. */
|
NULL, /* Reset global information. */
|
NULL, /* Free basic block info. */
|
NULL, /* Free basic block info. */
|
df_ri_compute, /* Local compute function. */
|
df_ri_compute, /* Local compute function. */
|
NULL, /* Init the solution specific data. */
|
NULL, /* Init the solution specific data. */
|
NULL, /* Iterative solver. */
|
NULL, /* Iterative solver. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator 0. */
|
NULL, /* Confluence operator n. */
|
NULL, /* Confluence operator n. */
|
NULL, /* Transfer function. */
|
NULL, /* Transfer function. */
|
NULL, /* Finalize function. */
|
NULL, /* Finalize function. */
|
df_ri_free, /* Free all of the problem information. */
|
df_ri_free, /* Free all of the problem information. */
|
df_ri_dump, /* Debugging. */
|
df_ri_dump, /* Debugging. */
|
|
|
/* Technically this is only dependent on the live registers problem
|
/* Technically this is only dependent on the live registers problem
|
but it will produce information if built one of uninitialized
|
but it will produce information if built one of uninitialized
|
register problems (UR, UREC) is also run. */
|
register problems (UR, UREC) is also run. */
|
df_lr_add_problem, /* Dependent problem. */
|
df_lr_add_problem, /* Dependent problem. */
|
0 /* Changeable flags. */
|
0 /* Changeable flags. */
|
};
|
};
|
|
|
|
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
/* Create a new DATAFLOW instance and add it to an existing instance
|
of DF. The returned structure is what is used to get at the
|
of DF. The returned structure is what is used to get at the
|
solution. */
|
solution. */
|
|
|
struct dataflow *
|
struct dataflow *
|
df_ri_add_problem (struct df *df, int flags)
|
df_ri_add_problem (struct df *df, int flags)
|
{
|
{
|
return df_add_problem (df, &problem_RI, flags);
|
return df_add_problem (df, &problem_RI, flags);
|
}
|
}
|
|
|
