From 11f6a29c9fc8f48bb917188c421f25e3a7f71199 Mon Sep 17 00:00:00 2001
From: Richard Stallman <rms@gnu.org>
Date: Wed, 2 Sep 1992 06:59:00 +0000
Subject: [PATCH] (print_node): Avoid 1 << (HOST_BITS_PER_INT - 1),

which overflows.  Use unsigned % to compute HASH.

From-SVN: r2027
---
 gcc/print-tree.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/gcc/print-tree.c b/gcc/print-tree.c
index 8b47cdb9d7b..6524b495c2b 100644
--- 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)
-- 
2.30.2