/* Routines for liveness in SSA trees.
- Copyright (C) 2003, 2004 Free Software Foundation, Inc.
+ Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
Contributed by Andrew MacLeod <amacleod@redhat.com>
This file is part of GCC.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING. If not, write to
-the Free Software Foundation, 59 Temple Place - Suite 330,
-Boston, MA 02111-1307, USA. */
+the Free Software Foundation, 51 Franklin Street, Fifth Floor,
+Boston, MA 02110-1301, USA. */
#ifndef _TREE_SSA_LIVE_H
#define _TREE_SSA_LIVE_H 1
#include "partition.h"
+#include "vecprim.h"
/* Used to create the variable mapping when we go out of SSA form. */
typedef struct _var_map
extern int var_union (var_map, tree, tree);
extern void change_partition_var (var_map, tree, int);
extern void compact_var_map (var_map, int);
-extern tree make_ssa_temp (tree);
+#ifdef ENABLE_CHECKING
+extern void register_ssa_partition_check (tree ssa_var);
+#endif
-static inline int num_var_partitions (var_map);
+static inline unsigned num_var_partitions (var_map);
static inline tree var_to_partition_to_var (var_map, tree);
static inline tree partition_to_var (var_map, int);
static inline int var_to_partition (var_map, tree);
#define SSA_VAR_MAP_REF_COUNT 0x01
extern var_map create_ssa_var_map (int);
-
/* Number of partitions in MAP. */
-static inline int
+static inline unsigned
num_var_partitions (var_map map)
{
return map->num_partitions;
version_ref_count (var_map map, tree ssa_var)
{
int version = SSA_NAME_VERSION (ssa_var);
-#ifdef ENABLE_CHECKING
- if (!map->ref_count)
- abort ();
-#endif
+ gcc_assert (map->ref_count);
return map->ref_count[version];
}
/* Given VAR, return the partition number in MAP which contains it.
- NO_PARTITION is returned if its not in any partition. */
+ NO_PARTITION is returned if it's not in any partition. */
static inline int
var_to_partition (var_map map, tree var)
int version;
#if defined ENABLE_CHECKING
- if (TREE_CODE (ssa_var) != SSA_NAME)
- abort ();
-
- if (!is_gimple_reg (SSA_NAME_VAR (ssa_var)))
- {
- fprintf (stderr, "Illegally registering a virtual SSA name :");
- print_generic_expr (stderr, ssa_var, TDF_SLIM);
- fprintf (stderr, " in the SSA->Normal phase.\n");
- abort();
- }
+ register_ssa_partition_check (ssa_var);
#endif
version = SSA_NAME_VERSION (ssa_var);
static inline int
partition_is_global (tree_live_info_p live, int p)
{
- if (!live->global)
- abort ();
-
+ gcc_assert (live->global);
return bitmap_bit_p (live->global, p);
}
static inline bitmap
live_entry_blocks (tree_live_info_p live, int p)
{
- if (!live->livein)
- abort ();
-
+ gcc_assert (live->livein);
return live->livein[p];
}
static inline bitmap
live_on_exit (tree_live_info_p live, basic_block bb)
{
- if (!live->liveout)
- abort();
+ gcc_assert (live->liveout);
+ gcc_assert (bb != ENTRY_BLOCK_PTR);
+ gcc_assert (bb != EXIT_BLOCK_PTR);
- if (bb == ENTRY_BLOCK_PTR || bb == EXIT_BLOCK_PTR)
- abort ();
-
return live->liveout[bb->index];
}
static inline void
live_merge_and_clear (tree_live_info_p live, int p1, int p2)
{
- bitmap_a_or_b (live->livein[p1], live->livein[p1], live->livein[p2]);
+ bitmap_ior_into (live->livein[p1], live->livein[p2]);
bitmap_zero (live->livein[p2]);
}
typedef struct tree_partition_associator_d
{
- varray_type trees;
- varray_type first_partition;
+ VEC(tree,heap) *trees;
+ VEC(int,heap) *first_partition;
int *next_partition;
int *partition_to_tree_map;
int num_trees;
static inline int tpa_num_trees (tpa_p);
static inline int tpa_find_tree (tpa_p, int);
static inline void tpa_decompact (tpa_p);
-extern tpa_p tpa_init (var_map);
extern void tpa_delete (tpa_p);
extern void tpa_dump (FILE *, tpa_p);
extern void tpa_remove_partition (tpa_p, int, int);
static inline tree
tpa_tree (tpa_p tpa, int i)
{
- return VARRAY_TREE (tpa->trees, i);
+ return VEC_index (tree, tpa->trees, i);
}
static inline int
tpa_first_partition (tpa_p tpa, int i)
{
- return VARRAY_INT (tpa->first_partition, i);
+ return VEC_index (int, tpa->first_partition, i);
}
a compressed element, so return TPA_NONE. */
if (index != TPA_NONE && index >= tpa_num_trees (tpa))
{
-#ifdef ENABLE_CHECKING
- if (tpa->uncompressed_num == -1)
- abort ();
-#endif
+ gcc_assert (tpa->uncompressed_num != -1);
index = TPA_NONE;
}
static inline void
tpa_decompact(tpa_p tpa)
{
-#ifdef ENABLE_CHECKING
- if (tpa->uncompressed_num == -1)
- abort ();
-#endif
+ gcc_assert (tpa->uncompressed_num != -1);
tpa->num_trees = tpa->uncompressed_num;
}
-/* Once a var_map has been created and compressed, a complimentary root_var
+/* Once a var_map has been created and compressed, a complementary root_var
object can be built. This creates a list of all the root variables from
which ssa version names are derived. Each root variable has a list of
which partitions are versions of that root.
extern coalesce_list_p create_coalesce_list (var_map);
extern void add_coalesce (coalesce_list_p, int, int, int);
+extern int coalesce_cost (int, bool, bool);
extern void sort_coalesce_list (coalesce_list_p);
extern void dump_coalesce_list (FILE *, coalesce_list_p);
extern void delete_coalesce_list (coalesce_list_p);
#define NO_BEST_COALESCE -1
-extern int pop_best_coalesce (coalesce_list_p, int *, int *);
extern conflict_graph build_tree_conflict_graph (tree_live_info_p, tpa_p,
coalesce_list_p);