Skip to content

R
riscv-gcc-1
Commit 11f6a29c by Richard Stallman
Options

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

which overflows.  Use unsigned % to compute HASH.

From-SVN: r2027
parent 54ca1d13
Showing with 1 additions and 1 deletions
gcc/print-tree.c
...@@ -205,7 +205,7 @@ print_node (file, prefix, node, indent) ...@@ -205,7 +205,7 @@ print_node (file, prefix, node, indent)
return; 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. */ /* If node is in the table, just mention its address. */
for (b = table[hash]; b; b = b->next) for (b = table[hash]; b; b = b->next)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment