This is the mail archive of the mailing list for the GCC project.

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

[patch] tree-ssa-live.c: Make some functions static.


Attached is a patch to make tpa_init and pop_best_coalesce static as
they are used only from tree-ssa-live.c.

Bootstrapped on i686-pc-linux-gnu.  OK to apply?

Kazu Hirata

2004-11-08  Kazu Hirata  <>

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

Index: tree-ssa-live.c
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-live.c,v
retrieving revision 2.24
diff -u -d -p -r2.24 tree-ssa-live.c
--- tree-ssa-live.c	4 Nov 2004 08:41:16 -0000	2.24
+++ tree-ssa-live.c	8 Nov 2004 19:13:10 -0000
@@ -779,7 +779,7 @@ calculate_live_on_exit (tree_live_info_p
 /* Initialize a tree_partition_associator object using MAP.  */
+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.  */
+static int
 pop_best_coalesce (coalesce_list_p cl, int *p1, int *p2)
   partition_pair_p node;
Index: tree-ssa-live.h
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-live.h,v
retrieving revision 2.9
diff -u -d -p -r2.9 tree-ssa-live.h
--- tree-ssa-live.h	4 Nov 2004 08:57:55 -0000	2.9
+++ tree-ssa-live.h	8 Nov 2004 19:13:11 -0000
@@ -356,7 +356,6 @@ static inline int tpa_next_partition (tp
 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 *, 
 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,

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]