[PATCH] Remove TREE_COMPLEXITY, take 2

[Paolo Bonzini]

This patch, based on the outcome of the thread between Steven Bosscher 
and Richard Kenner, is another attempt at removing TREE_COMPLEXITY. 
While this patch is not based on Steven's, the credit goes undoubtedly 
to him for his "nursing" GCC until this little field could be removed.

I found that the required hash table functions are actually already 
present in tree.c.  There we have an implementation of a tree -> 
unsigned short hash table; we need tree -> unsigned int instead but it 
is not a problem to widen the values' type.  The hash table uses 
htab_hash_pointer to compute the hash value, which means that it does 
not dive into the values that it holds.

Since Richard K. is a GWP, and since by now TREE_COMPLEXITY is an 
Ada-only thing (gigi-only) I placed in this patch also the actual 
removal of TREE_COMPLEXITY.

Boostrapped/regtested C/C++/Ada, i686-pc-linux-gnu, ok for mainline?

Paolo
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: no-tree-complexity.patch
URL: <http://gcc.gnu.org/pipermail/gcc-patches/attachments/20070205/f1f21d48/attachment.ksh>