user/sven/linux.git/include/linux/jhash.h, branch v3.16.1

The new jhash implementation

2010-12-10T04:17:07Z

The current jhash.h implements the lookup2() hash function by Bob Jenkins. However, lookup2() is outdated as Bob wrote a new hash function called lookup3(). The patch replaces the lookup2() implementation of the 'jhash*' functions with that of lookup3(). You can read a longer comparison of the two and other hash functions at http://burtleburtle.net/bob/hash/doobs.html. Signed-off-by: Jozsef Kadlecsik Acked-by: Rusty Russell Signed-off-by: David S. Miller

Fix spelling mistake in jhash

2010-08-18T08:19:52Z

Fix a spelling mistake. Signed-off-by: Anton Blanchard Signed-off-by: Jiri Kosina

[JHASH]: Use const in jhash2

2007-04-26T05:25:52Z

Use const to avoid forcing users to cast const data. Signed-off-by: Patrick McHardy Signed-off-by: David S. Miller

[JHASH]: Make key arg const in jhash().

2004-02-26T03:50:43Z

[NET]: Cosmetic cleanups of jhash code.

2003-05-03T03:01:33Z

- Consistent naming (i.e. jhash_xxx) - Reduces the 2&1 word variants to call jhash_3words() - Replaces __inline__ with inline.

[NET]: Fix hashing exploits in ipv4 routing, IP conntrack, and TCP synq.

2003-05-02T17:43:27Z

Several hash table implementations in the networking were remotely exploitable. Remote attackers could launch attacks whereby, using carefully choosen forged source addresses, make every routing cache entry get hashed into the same hash chain. Netfilter's IP conntrack module and the TCP syn-queue implementation had identical vulnerabilities and have been fixed too. The choosen solution to the problem involved using Bob's Jenkins hash along with a randomly choosen input. For the ipv4 routing cache we take things one step further and periodically choose a new random secret. By default this happens every 10 minutes, but this is configurable by the user via sysctl knobs.