cgraph.h (cgraph_calls_p): Remove.

	* cgraph.h (cgraph_calls_p): Remove.
	* cgraph.c (cgraph_calls_p): Likewise.

	* varray.h (varray_copy): Remove.
	* varray.c (varray_copy): Likewise.

From-SVN: r90261

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index a4965d929fca0608141ae02aec155ce2080c0349..163deb9a01ed89a5567dcac7917c7b8c45e46f1c 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,11 @@
+2004-11-08  Ben Elliston  <bje@au.ibm.com>
+
+       * cgraph.h (cgraph_calls_p): Remove.
+       * cgraph.c (cgraph_calls_p): Likewise.
+
+       * varray.h (varray_copy): Remove.
+       * varray.c (varray_copy): Likewise.
+
 2004-11-07  Andrew Pinski  <pinskia@physics.uc.edu>
 
        PR target/18269

diff --git a/gcc/cgraph.c b/gcc/cgraph.c
index edde1a978d3296f0fef0e0b140896140c96a8868..0908b6a02eb76511823840ccbb7ae4abaa51ccc5 100644 (file)
--- a/gcc/cgraph.c
+++ b/gcc/cgraph.c
@@ -386,21 +386,6 @@ cgraph_mark_needed_node (struct cgraph_node *node)
   cgraph_mark_reachable_node (node);
 }
 
-/* Return true when CALLER_DECL calls CALLEE_DECL.  */
-
-bool
-cgraph_calls_p (tree caller_decl, tree callee_decl)
-{
-  struct cgraph_node *caller = cgraph_node (caller_decl);
-  struct cgraph_node *callee = cgraph_node (callee_decl);
-  struct cgraph_edge *edge;
-
-  for (edge = callee->callers; edge && (edge)->caller != caller;
-       edge = (edge->next_caller))
-    continue;
-  return edge != NULL;
-}
-
 /* Return local info for the compiled function.  */
 
 struct cgraph_local_info *

diff --git a/gcc/cgraph.h b/gcc/cgraph.h
index 180ddb8f40c9eda9d38fc20c96a30736121eb697..cd4c9d1056679e0b9e1fe24511d1091fc37b0e69 100644 (file)
--- a/gcc/cgraph.h
+++ b/gcc/cgraph.h
@@ -169,7 +169,6 @@ struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
                                        tree);
 struct cgraph_node *cgraph_node (tree decl);
 struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree call_expr);
-bool cgraph_calls_p (tree, tree);
 struct cgraph_local_info *cgraph_local_info (tree);
 struct cgraph_global_info *cgraph_global_info (tree);
 struct cgraph_rtl_info *cgraph_rtl_info (tree);

diff --git a/gcc/varray.c b/gcc/varray.c
index c5c3a8ec4201df123553e473ceeedc01b0eb375a..ce3503b8bcde9d9fca874974ba3f080e17be3b45 100644 (file)
--- a/gcc/varray.c
+++ b/gcc/varray.c
@@ -218,25 +218,6 @@ varray_underflow (varray_type va, const char *file, int line,
 #endif
 
 
-/* Copy varray V2 into varray V1.  Both arrays must be the same size
-   and type.  */
-
-void
-varray_copy (varray_type v1, varray_type v2)
-{
-  size_t data_size;
-  
-  if (v1->type != v2->type)
-    abort ();
-
-  if (v1->num_elements != v2->num_elements)
-    abort ();
-
-  data_size = element[v2->type].size * v2->num_elements;
-  memcpy (v1->data.c, v2->data.c, data_size);
-  v1->elements_used = v2->elements_used;
-}
-
 /* Output per-varray statistics.  */
 #ifdef GATHER_STATISTICS
 

diff --git a/gcc/varray.h b/gcc/varray.h
index 371e4e70bcb7f71df132c73760deb690ecaa9067..f1012f4a5c4113c7145e5cfbcc9069dd8638f9c7 100644 (file)
--- a/gcc/varray.h
+++ b/gcc/varray.h
@@ -240,8 +240,6 @@ extern varray_type varray_grow (varray_type, size_t);
 #define VARRAY_CLEAR(VA) varray_clear(VA)
 
 extern void varray_clear (varray_type);
-extern void varray_copy (varray_type v1, varray_type v2);
-
 extern void dump_varray_statistics (void);
 
 /* Check for VARRAY_xxx macros being in bound.  */