* search.c (my_tree_cons): Clean up.

From-SVN: r21158

diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog
index 5f27bf652df2d660ecbe4dd1253f2d47fc9fda48..76ecb6331b183e4373af247fc6a2d96188439619 100644 (file)
--- a/gcc/cp/ChangeLog
+++ b/gcc/cp/ChangeLog
@@ -1,3 +1,7 @@
+Tue Jul 14 20:09:22 1998  Jeffrey A Law  (law@cygnus.com)
+
+       * search.c (my_tree_cons): Clean up.
+
 1998-07-14  Jason Merrill  <jason@yorick.cygnus.com>
 
        * call.c (joust): Don't warn about "confusing" conversions to the

diff --git a/gcc/cp/search.c b/gcc/cp/search.c
index b58c61fab64b329f7f1f2b7c2e7d94362687ea6c..ebd788a31bf6ceaa20418408cb94011606ebd985 100644 (file)
--- a/gcc/cp/search.c
+++ b/gcc/cp/search.c
@@ -261,12 +261,8 @@ my_tree_cons (purpose, value, chain)
      tree purpose, value, chain;
 {
   tree p = (tree)obstack_alloc (&type_obstack_entries, sizeof (struct tree_list));
+  bzero ((char *)p, sizeof (struct tree_list));
   ++my_tree_node_counter;
-  TREE_TYPE (p) = NULL_TREE;
-  /* The type of the last on the LHS of this statement must be a pointer
-     to the same type as the bitfields in struct tree_common.  Otherwise
-     we may write beyond our intended area.  */
-  ((unsigned *)p)[2] = 0;
   TREE_SET_CODE (p, TREE_LIST);
   TREE_PURPOSE (p) = purpose;
   TREE_VALUE (p) = value;