From 739485aaec930d343c73006a3d77ace3f3c899cf Mon Sep 17 00:00:00 2001 From: kazu Date: Mon, 8 Nov 2004 22:36:48 +0000 Subject: * tree-ssa-live.c (tpa_init, pop_best_coalesce): Make them static. * tree-ssa-live.h: Remove the corresponding prototypes. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@90311 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/ChangeLog | 6 ++++++ gcc/tree-ssa-live.c | 4 ++-- gcc/tree-ssa-live.h | 2 -- 3 files changed, 8 insertions(+), 4 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 213f0dc2c36..4c08af64912 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2004-11-08 Kazu Hirata + + * tree-ssa-live.c (tpa_init, pop_best_coalesce): Make them + static. + * tree-ssa-live.h: Remove the corresponding prototypes. + 2004-11-08 Kazu Hirata * tree-if-conv.c (tree_if_conversion): Make it static. diff --git a/gcc/tree-ssa-live.c b/gcc/tree-ssa-live.c index b3f0b785534..554a0397a32 100644 --- a/gcc/tree-ssa-live.c +++ b/gcc/tree-ssa-live.c @@ -779,7 +779,7 @@ calculate_live_on_exit (tree_live_info_p liveinfo) /* Initialize a tree_partition_associator object using MAP. */ -tpa_p +static tpa_p tpa_init (var_map map) { tpa_p tpa; @@ -1233,7 +1233,7 @@ sort_coalesce_list (coalesce_list_p cl) partitions via P1 and P2. Their calculated cost is returned by the function. NO_BEST_COALESCE is returned if the coalesce list is empty. */ -int +static int pop_best_coalesce (coalesce_list_p cl, int *p1, int *p2) { partition_pair_p node; diff --git a/gcc/tree-ssa-live.h b/gcc/tree-ssa-live.h index ee6ee4c4b76..b109c252344 100644 --- a/gcc/tree-ssa-live.h +++ b/gcc/tree-ssa-live.h @@ -356,7 +356,6 @@ static inline int tpa_next_partition (tpa_p, int); 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); @@ -707,7 +706,6 @@ 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); -- cgit v1.2.1