From: Jeffrey A Law Date: Tue, 14 Jul 1998 19:11:25 +0000 (+0000) Subject: * search.c (my_tree_cons): Clean up. X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=2c43b71ae591716613d94d074132e9c9f3642c2d;p=gcc.git * search.c (my_tree_cons): Clean up. From-SVN: r21158 --- diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog index 5f27bf652df..76ecb6331b1 100644 --- 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 * call.c (joust): Don't warn about "confusing" conversions to the diff --git a/gcc/cp/search.c b/gcc/cp/search.c index b58c61fab64..ebd788a31bf 100644 --- 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;