Skip to content

R
riscv-gcc-1
Commit 8860ddab by Michael Meissner Committed by Michael Meissner
Options

Silence warning 

From-SVN: r40511
parent b216e516
Showing with 45 additions and 32 deletions
libiberty/ChangeLog
2001-03-15 Michael Meissner <meissner@redhat.com>
* hashtab.c (higher_prime_number): Silence warning that 4294967291
might be a signed integer under pre-ISO C systems.
2001-03-10 Neil Booth <neil@daikokuya.demon.co.uk> 2001-03-10 Neil Booth <neil@daikokuya.demon.co.uk>
John David Anglin <dave@hiauly1.hia.nrc.ca> John David Anglin <dave@hiauly1.hia.nrc.ca>
......
libiberty/hashtab.c
/* An expandable hash tables datatype. /* An expandable hash tables datatype.
Copyright (C) 1999, 2000 Free Software Foundation, Inc. Copyright (C) 1999, 2000, 2001 Free Software Foundation, Inc.
Contributed by Vladimir Makarov (vmakarov@cygnus.com). Contributed by Vladimir Makarov (vmakarov@cygnus.com).
This file is part of the libiberty library. This file is part of the libiberty library.
...@@ -71,6 +71,14 @@ static PTR *find_empty_slot_for_expand PARAMS ((htab_t, hashval_t)); ...@@ -71,6 +71,14 @@ static PTR *find_empty_slot_for_expand PARAMS ((htab_t, hashval_t));
htab_hash htab_hash_pointer = hash_pointer; htab_hash htab_hash_pointer = hash_pointer;
htab_eq htab_eq_pointer = eq_pointer; htab_eq htab_eq_pointer = eq_pointer;
/* This avoids a warning that 4294967291 is signed for pre-ISO C systems and
unsigned for ISO C systems on 32-bit hosts. */
#ifdef __STDC__
#define UL(num) num ## UL
#else
#define UL(num) ((unsigned long)(num/**/L))
#endif
/* The following function returns a nearest prime number which is /* The following function returns a nearest prime number which is
greater than N, and near a power of two. */ greater than N, and near a power of two. */
...@@ -81,37 +89,37 @@ higher_prime_number (n) ...@@ -81,37 +89,37 @@ higher_prime_number (n)
/* These are primes that are near, but slightly smaller than, a /* These are primes that are near, but slightly smaller than, a
power of two. */ power of two. */
static unsigned long primes[] = { static unsigned long primes[] = {
2, UL(2),
7, UL(7),
13, UL(13),
31, UL(31),
61, UL(61),
127, UL(127),
251, UL(251),
509, UL(509),
1021, UL(1021),
2039, UL(2039),
4093, UL(4093),
8191, UL(8191),
16381, UL(16381),
32749, UL(32749),
65521, UL(65521),
131071, UL(131071),
262139, UL(262139),
524287, UL(524287),
1048573, UL(1048573),
2097143, UL(2097143),
4194301, UL(4194301),
8388593, UL(8388593),
16777213, UL(16777213),
33554393, UL(33554393),
67108859, UL(67108859),
134217689, UL(134217689),
268435399, UL(268435399),
536870909, UL(536870909),
1073741789, UL(1073741789),
2147483647, UL(2147483647),
4294967291 UL(4294967291),
}; };
unsigned long* low = &primes[0]; unsigned long* low = &primes[0];
......
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