[tree-ssa] Get rid of some warnings
Andreas Jaeger
aj@suse.de
Tue Jul 23 09:46:00 GMT 2002
Based on all of your comments, here's the patch that follows your
comments which I considered as approval.
I'll commit the patch after bootstrapping/regtesting,
Andreas
2002-07-23 Andreas Jaeger <aj@suse.de>
* tree-ssa-pre.c (hash_expr_tree): Remove.
* c-call-graph.c (write_dtd): Remove.
* tree-ssa.c (delete_refs): Remove.
============================================================
Index: gcc/tree-ssa.c
--- gcc/tree-ssa.c 10 Jul 2002 00:04:41 -0000 1.1.4.4
+++ gcc/tree-ssa.c 23 Jul 2002 16:26:43 -0000
@@ -1,5 +1,5 @@
/* SSA for trees.
- Copyright (C) 2001 Free Software Foundation, Inc.
+ Copyright (C) 2001, 2002 Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GNU CC.
@@ -59,7 +59,6 @@ static void insert_phi_terms PARAMS ((sb
static void build_fud_chains PARAMS ((dominance_info));
static void search_fud_chains PARAMS ((basic_block, dominance_info));
static void follow_chain PARAMS ((varref, varref));
-static void delete_refs PARAMS ((varray_type));
/* Build the SSA form for the given function. This implements Factored
@@ -376,38 +375,6 @@ delete_ssa ()
for (i = 0; i < NREF_SYMBOLS; i++)
delete_ref_list (TREE_REFS (REF_SYMBOL (i)));
-}
-
-/* Deallocate memory associated with an array of references. */
-
-static void
-delete_refs (refs)
- varray_type refs;
-{
- size_t i;
-
- if (refs == NULL)
- return;
-
- for (i = 0; i < VARRAY_ACTIVE_SIZE (refs); i++)
- {
- varref ref = VARRAY_GENERIC_PTR (refs, i);
-
- if (VARREF_TYPE (ref) == VARDEF)
- {
- delete_ref_list (VARDEF_IMM_USES (ref));
- delete_ref_list (VARDEF_RUSES (ref));
- VARDEF_PHI_CHAIN (ref) = NULL;
- VARDEF_PHI_CHAIN_BB (ref) = NULL;
- }
- else if (VARREF_TYPE (ref) == VARUSE)
- delete_ref_list (VARUSE_RDEFS (ref));
- else if (VARREF_TYPE (ref) == EXPRPHI)
- {
- BITMAP_XFREE (EXPRPHI_PROCESSED (ref));
- EXPRPHI_PHI_CHAIN (ref) = NULL;
- }
- }
}
============================================================
Index: gcc/c-call-graph.c
--- gcc/c-call-graph.c 23 Jul 2002 08:49:30 -0000 1.1.4.2
+++ gcc/c-call-graph.c 23 Jul 2002 16:27:41 -0000
@@ -32,7 +32,6 @@ Software Foundation, 59 Temple Place - S
/* Static declarations. */
static void construct_call_graph PARAMS ((output_buffer *, tree, HOST_WIDE_INT));
-static void write_dtd PARAMS ((output_buffer *));
static void print_callee PARAMS ((output_buffer *, tree, int));
#define INDENT(SPACE) do { \
@@ -53,7 +52,6 @@ print_call_graph (file, t)
init_output_buffer (buffer, /* prefix */NULL, /* line-width */0);
output_clear_message_text (buffer);
- /* write_dtd (buffer); */
output_printf (buffer, "<file>\n");
construct_call_graph (buffer, t, 0);
output_printf (buffer, "</file>\n");
@@ -321,33 +319,4 @@ print_callee (buffer, node, spc)
output_printf (buffer, "<callee idref = \"");
print_function_decl (buffer, node, 0);
output_printf (buffer, "\"/>\n");
-}
-
-/* Write the DTD in the given buffer. */
-
-static void
-write_dtd (buffer)
- output_buffer *buffer;
-{
- output_printf (buffer, "\
-<?xml version=\"1.0\"?>\n\
-<!DOCTYPE functions [\n\
- <!ELEMENT file (caller|gvar)*>\n\
- <!ELEMENT gvar EMPTY>\n\
- <!ATTLIST gvar vid ID #REQUIRED>\n\
- <!ELEMENT caller ((uvar|callee|caller)*, stats)>\n\
- <!ATTLIST caller fid ID #REQUIRED>\n\
- <!ELEMENT callee EMPTY>\n\
- <!ATTLIST callee fid IDREF #REQUIRED>\n\
- <!ELEMENT uvar EMPTY>\n\
- <!ATTLIST uvar vid IDREF #REQUIRED>\n\
- <!ELEMENT stats EMPTY>\n\
- <!ATTLIST stats calls CDATA>\n\
- <!ATTLIST stats decisions CDATA>\n\
- <!ATTLIST stats stmts CDATA>\n\
- <!ATTLIST stats Gilb CDATA>\n\
- <!ATTLIST stats CFG-edges CDATA>\n\
- <!ATTLIST stats CFG-BB CDATA>\n\
- <!ATTLIST stats McCabe CDATA>\n\
-]>\n");
}
============================================================
Index: gcc/tree-ssa-pre.c
--- gcc/tree-ssa-pre.c 23 Jul 2002 08:49:30 -0000 1.1.4.7
+++ gcc/tree-ssa-pre.c 23 Jul 2002 16:29:33 -0000
@@ -59,7 +59,6 @@ Boston, MA 02111-1307, USA. */
*/
struct expr_info;
-static hashval_t hash_expr_tree PARAMS ((const void *));
static int expr_lexically_eq PARAMS ((tree, tree));
static void free_expr_info PARAMS ((struct expr_info *));
static sbitmap compute_idfs PARAMS ((sbitmap *, tree));
@@ -202,36 +201,6 @@ compute_idfs (dfs, stmt)
}
-/* We need lexically equivalent expressions to be compared using the
- equality function, so the hash needs to make sure they end up
- colliding. */
-static hashval_t
-hash_expr_tree (v)
- const void *v;
-{
- tree t = (tree) v;
- tree op0, op1;
- hashval_t ret = 0;
-
- STRIP_NOPS (t);
- ret += TREE_CODE (t);
- if (TREE_CODE_CLASS (TREE_CODE (t)) != 'd')
- {
- if (TREE_OPERAND (t, 0))
- {
- op0 = TREE_OPERAND (t, 0);
- STRIP_NOPS (op0);
- ret += TREE_CODE (op0);
- }
- if (TREE_OPERAND (t, 1))
- {
- op1 = TREE_OPERAND (t, 1);
- STRIP_NOPS (op1);
- ret += TREE_CODE (op1);
- }
- }
- return ret;
-}
/* Determine if two expressions are lexically equivalent.
Return a value like one that would be used for qsort comparisons,
--
Andreas Jaeger
SuSE Labs aj@suse.de
private aj@arthur.inka.de
http://www.suse.de/~aj
More information about the Gcc-patches
mailing list