What hashing function/algorithm does Perl use ?

Question

Could you someone shed some light on the hashing function/algorithm Perl uses to map a string to an index ? Any relevant reading ?

What are you trying to do? Can you provide an example of some code that isn't working? — Alex W
– Alex W, Commented Jun 26, 2012 at 19:16
There is no two key that will always collide. The hashing is randomly perturbed when necessary. — ikegami
– ikegami, Commented Jun 26, 2012 at 20:48
You can tell a collision occurred by looking for a lack of increase in the left-hand number returned by perl -wE'for ("a".."z") { ++$h{$_}; say "".%h; }' — ikegami
– ikegami, Commented Jun 26, 2012 at 20:49
alertjean: Why would any collision be "code that isn't working"? I think you are expecting problems that just don't exist. — ysth
– ysth, Commented Jun 27, 2012 at 7:46

ikegami · Accepted Answer · 2018-06-23 21:31:11Z

15

[This answer predates the hashing function change made in 5.28. See "Default Hash Function Change" in the perldelta for 5.28.]

PERL_HASH_INTERNAL_, defined in hv.h, copied below:

/* hash a key */
/* FYI: This is the "One-at-a-Time" algorithm by Bob Jenkins
 * from requirements by Colin Plumb.
 * (http://burtleburtle.net/bob/hash/doobs.html) */
/* The use of a temporary pointer and the casting games
 * is needed to serve the dual purposes of
 * (a) the hashed data being interpreted as "unsigned char" (new since 5.8,
 *     a "char" can be either signed or unsigned, depending on the compiler)
 * (b) catering for old code that uses a "char"
 *
 * The "hash seed" feature was added in Perl 5.8.1 to perturb the results
 * to avoid "algorithmic complexity attacks".
 *
 * If USE_HASH_SEED is defined, hash randomisation is done by default
 * If USE_HASH_SEED_EXPLICIT is defined, hash randomisation is done
 * only if the environment variable PERL_HASH_SEED is set.
 * For maximal control, one can define PERL_HASH_SEED.
 * (see also perl.c:perl_parse()).
 */

#define PERL_HASH_INTERNAL_(hash,str,len,internal) \
    STMT_START { \
       register const char * const s_PeRlHaSh_tmp = str; \
       register const unsigned char *s_PeRlHaSh = (const unsigned char *)s_PeRlHaSh_tmp; \
       register I32 i_PeRlHaSh = len; \
       register U32 hash_PeRlHaSh = (internal ? PL_rehash_seed : PERL_HASH_SEED); \
       while (i_PeRlHaSh--) { \
           hash_PeRlHaSh += *s_PeRlHaSh++; \
           hash_PeRlHaSh += (hash_PeRlHaSh << 10); \
           hash_PeRlHaSh ^= (hash_PeRlHaSh >> 6); \
       } \
       hash_PeRlHaSh += (hash_PeRlHaSh << 3); \
       hash_PeRlHaSh ^= (hash_PeRlHaSh >> 11); \
       (hash) = (hash_PeRlHaSh + (hash_PeRlHaSh << 15)); \
   } STMT_END

edited Jun 23, 2018 at 21:31

answered Jun 26, 2012 at 19:23

ikegami

391k17 gold badges291 silver badges554 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

Jean Over a year ago

Is this implementation of some generic algorithm ?

Schwern Over a year ago

@alertjean Yes, the comments from the code say it's a version of burtleburtle.net/bob/hash/doobs.html

Collectives™ on Stack Overflow

What hashing function/algorithm does Perl use ?

1 Answer 1

2 Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

2 Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related