(print_node): Avoid 1 << (HOST_BITS_PER_INT - 1),

which overflows.  Use unsigned % to compute HASH.

From-SVN: r2027

diff --git a/gcc/print-tree.c b/gcc/print-tree.c
index 8b47cdb9d7bab0a7af75ec1829d50b8e48a0636f..6524b495c2b30d611cb27a9530963c90418d44de 100644 (file)
--- a/gcc/print-tree.c
+++ b/gcc/print-tree.c
@@ -205,7 +205,7 @@ print_node (file, prefix, node, indent)
       return;
     }
 
-  hash = ((HOST_WIDE_INT) node & ~(1 << (HOST_BITS_PER_INT - 1))) % HASH_SIZE;
+  hash = ((unsigned HOST_WIDE_INT) node) % HASH_SIZE;
 
   /* If node is in the table, just mention its address.  */
   for (b = table[hash]; b; b = b->next)