projects
/
awesomized
/
libmemcached
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
|
github
raw
|
inline
| side by side
cmake: build&run tests (sortof)
[awesomized/libmemcached]
/
libhashkit
/
jenkins.cc
diff --git
a/libhashkit/jenkins.cc
b/libhashkit/jenkins.cc
index 2001cab47cc7b6192f69e4b103d763b51a3b3b23..3c6558a42ad9a21d9980dcb8983056f9dd073e1e 100644
(file)
--- a/
libhashkit/jenkins.cc
+++ b/
libhashkit/jenkins.cc
@@
-173,23
+173,28
@@
uint32_t hashkit_jenkins(const char *key, size_t length, void *)
b+=k[2]+(((uint32_t)k[3])<<16);
a+=k[0]+(((uint32_t)k[1])<<16);
break;
b+=k[2]+(((uint32_t)k[3])<<16);
a+=k[0]+(((uint32_t)k[1])<<16);
break;
- case 11: c+=((uint32_t)k8[10])<<16; /* fall through */
+ case 11: c+=((uint32_t)k8[10])<<16;
+ /* fall through */
case 10: c+=k[4];
b+=k[2]+(((uint32_t)k[3])<<16);
a+=k[0]+(((uint32_t)k[1])<<16);
break;
case 10: c+=k[4];
b+=k[2]+(((uint32_t)k[3])<<16);
a+=k[0]+(((uint32_t)k[1])<<16);
break;
- case 9 : c+=k8[8]; /* fall through */
+ case 9 : c+=k8[8];
+ /* fall through */
case 8 : b+=k[2]+(((uint32_t)k[3])<<16);
a+=k[0]+(((uint32_t)k[1])<<16);
break;
case 8 : b+=k[2]+(((uint32_t)k[3])<<16);
a+=k[0]+(((uint32_t)k[1])<<16);
break;
- case 7 : b+=((uint32_t)k8[6])<<16; /* fall through */
+ case 7 : b+=((uint32_t)k8[6])<<16;
+ /* fall through */
case 6 : b+=k[2];
a+=k[0]+(((uint32_t)k[1])<<16);
break;
case 6 : b+=k[2];
a+=k[0]+(((uint32_t)k[1])<<16);
break;
- case 5 : b+=k8[4]; /* fall through */
+ case 5 : b+=k8[4];
+ /* fall through */
case 4 : a+=k[0]+(((uint32_t)k[1])<<16);
break;
case 4 : a+=k[0]+(((uint32_t)k[1])<<16);
break;
- case 3 : a+=((uint32_t)k8[2])<<16; /* fall through */
+ case 3 : a+=((uint32_t)k8[2])<<16;
+ /* fall through */
case 2 : a+=k[0];
break;
case 1 : a+=k8[0];
case 2 : a+=k[0];
break;
case 1 : a+=k8[0];
@@
-228,16
+233,27
@@
uint32_t hashkit_jenkins(const char *key, size_t length, void *)
switch(length) /* all the case statements fall through */
{
case 12: c+=((uint32_t)k[11])<<24;
switch(length) /* all the case statements fall through */
{
case 12: c+=((uint32_t)k[11])<<24;
+ /* fall through */
case 11: c+=((uint32_t)k[10])<<16;
case 11: c+=((uint32_t)k[10])<<16;
+ /* fall through */
case 10: c+=((uint32_t)k[9])<<8;
case 10: c+=((uint32_t)k[9])<<8;
+ /* fall through */
case 9 : c+=k[8];
case 9 : c+=k[8];
+ /* fall through */
case 8 : b+=((uint32_t)k[7])<<24;
case 8 : b+=((uint32_t)k[7])<<24;
+ /* fall through */
case 7 : b+=((uint32_t)k[6])<<16;
case 7 : b+=((uint32_t)k[6])<<16;
+ /* fall through */
case 6 : b+=((uint32_t)k[5])<<8;
case 6 : b+=((uint32_t)k[5])<<8;
+ /* fall through */
case 5 : b+=k[4];
case 5 : b+=k[4];
+ /* fall through */
case 4 : a+=((uint32_t)k[3])<<24;
case 4 : a+=((uint32_t)k[3])<<24;
+ /* fall through */
case 3 : a+=((uint32_t)k[2])<<16;
case 3 : a+=((uint32_t)k[2])<<16;
+ /* fall through */
case 2 : a+=((uint32_t)k[1])<<8;
case 2 : a+=((uint32_t)k[1])<<8;
+ /* fall through */
case 1 : a+=k[0];
break;
case 0 : return c;
case 1 : a+=k[0];
break;
case 0 : return c;