tree.c (type_hash_add): Use permalloc to allocate nodes in the hashtable.

	* tree.c (type_hash_add): Use permalloc to allocate nodes in the
	hashtable.

From-SVN: r28728

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index f9acd6511952cacafb646955f228697028fe328c..0306225202d5c2c1bcccb7578e0c663a155905af 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+Mon Aug 16 11:56:36 1999  Mark Mitchell  <mark@codesourcery.com>
+
+       * tree.c (type_hash_add): Use permalloc to allocate nodes in the
+       hashtable.
+
 Mon Aug 16 17:04:15 1999  Jorn Rennecke <amylaar@cygnus.co.uk>
 
        * mips.h (CLASS_CANNOT_CHANGE_SIZE): Define.

diff --git a/gcc/tree.c b/gcc/tree.c
index 2516301ba54028fa57d8600a9f55b44daefcc0d6..c688dfc5eb8d2af3c483a430398101e8eb92398b 100644 (file)
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -3759,7 +3759,7 @@ type_hash_add (hashcode, type)
 {
   register struct type_hash *h;
 
-  h = (struct type_hash *) oballoc (sizeof (struct type_hash));
+  h = (struct type_hash *) permalloc (sizeof (struct type_hash));
   h->hashcode = hashcode;
   h->type = type;
   h->next = type_hash_table[hashcode % TYPE_HASH_SIZE];