kotovalexarian-likes-github/ruby--ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2022-11-09 12:17:21 -05:00
Code Releases Activity

hash.c: prime2

Browse source 
* hash.c (prime2): turned into a uint32_t prime, as the lower
  32bits, non-prime part only was used always.

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@61473 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
nobu 2017-12-25 12:41:52 +00:00
parent ce52dfde9c
commit baa53f625d
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
hash.c
View file

@ -224,7 +224,7 @@ rb_any_hash(VALUE a)
/* Here we two primes with random bit generation. */
static const uint64_t prime1 = ((uint64_t)0x2e0bb864 << 32) | 0xe9ea7df5;
static const uint64_t prime2 = ((uint64_t)0xcdb32970 << 32) | 0x830fcaa1;
static const uint32_t prime2 = 0x830fcab9;
static inline uint64_t
@ -253,7 +253,7 @@ key64_hash(uint64_t key, uint32_t seed)
long
rb_objid_hash(st_index_t index)
{
return (long)key64_hash(rb_hash_start(index), (uint32_t)prime2);
return (long)key64_hash(rb_hash_start(index), prime2);
}
static st_index_t
@ -290,7 +290,7 @@ rb_ident_hash(st_data_t n)
}
#endif
return (st_index_t)key64_hash(rb_hash_start((st_index_t)n), (uint32_t)prime2);
return (st_index_t)key64_hash(rb_hash_start((st_index_t)n), prime2);
}
static const struct st_hash_type identhash = {