tree-ssa-live.c (tpa_init, [...]): Make them static.

	* tree-ssa-live.c (tpa_init, pop_best_coalesce): Make them
	static.
	* tree-ssa-live.h: Remove the corresponding prototypes.

From-SVN: r90311

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 213f0dc2c36265d1e7adf7dce1f3f18ab03b36fb..4c08af64912992e8b97688fa9035899cd7dc9fa7 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
+2004-11-08  Kazu Hirata  <kazu@cs.umass.edu>
+
+       * 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  <kazu@cs.umass.edu>
 
        * 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 b3f0b78553461a1e6945785570ac5eea6cc846d1..554a0397a32dfbc18adf7bd0c91f5fe812ddd0c5 100644 (file)
--- 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 ee6ee4c4b76f6269e5e186becf237083e8d675d3..b109c252344a93ec8bb2b6bbc20b23058ac06062 100644 (file)
--- 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);