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
This commit is contained in:
parent
b8a55285ff
commit
1590235e1e
@ -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
|
||||
|
15
gcc/cgraph.c
15
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 *
|
||||
|
@ -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);
|
||||
|
19
gcc/varray.c
19
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
|
||||
|
||||
|
@ -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. */
|
||||
|
Loading…
Reference in New Issue
Block a user