diff options
| author | DJ Delorie <dj@delorie.com> | 2001-10-07 17:24:36 +0000 |
|---|---|---|
| committer | DJ Delorie <dj@delorie.com> | 2001-10-07 17:24:36 +0000 |
| commit | 5849f895508122d117627bfddf595a51eedab5c0 (patch) | |
| tree | b60cf6a44d847600bfe9337c565df06e95d20694 /libiberty/hashtab.c | |
| parent | 6aaed9d2f5048ee39103ba0782588562e726d98d (diff) | |
| download | gdb-5849f895508122d117627bfddf595a51eedab5c0.tar.gz | |
merge from gcc
Diffstat (limited to 'libiberty/hashtab.c')
| -rw-r--r-- | libiberty/hashtab.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/libiberty/hashtab.c b/libiberty/hashtab.c index 89bfe085be9..36ad6e4940b 100644 --- a/libiberty/hashtab.c +++ b/libiberty/hashtab.c @@ -80,7 +80,7 @@ higher_prime_number (n) { /* These are primes that are near, but slightly smaller than, a power of two. */ - static unsigned long primes[] = { + static const unsigned long primes[] = { (unsigned long) 2, (unsigned long) 7, (unsigned long) 13, @@ -115,12 +115,12 @@ higher_prime_number (n) ((unsigned long) 2147483647) + ((unsigned long) 2147483644), }; - unsigned long* low = &primes[0]; - unsigned long* high = &primes[sizeof(primes) / sizeof(primes[0])]; + const unsigned long *low = &primes[0]; + const unsigned long *high = &primes[sizeof(primes) / sizeof(primes[0])]; while (low != high) { - unsigned long* mid = low + (high - low) / 2; + const unsigned long *mid = low + (high - low) / 2; if (n > *mid) low = mid + 1; else |