aboutsummaryrefslogtreecommitdiffstats
path: root/gtp/lookupa.c
diff options
context:
space:
mode:
Diffstat (limited to 'gtp/lookupa.c')
-rw-r--r--gtp/lookupa.c256
1 files changed, 155 insertions, 101 deletions
diff --git a/gtp/lookupa.c b/gtp/lookupa.c
index 8ff114b..1eff74a 100644
--- a/gtp/lookupa.c
+++ b/gtp/lookupa.c
@@ -81,52 +81,64 @@ acceptable. Do NOT use for cryptographic purposes.
--------------------------------------------------------------------
*/
-ub4 lookup( k, length, level)
-register ub1 *k; /* the key */
-register ub4 length; /* the length of the key */
-register ub4 level; /* the previous hash, or an arbitrary value */
+ub4 lookup(k, length, level)
+register ub1 *k; /* the key */
+register ub4 length; /* the length of the key */
+register ub4 level; /* the previous hash, or an arbitrary value */
{
- register ub4 a,b,c,len;
+ register ub4 a, b, c, len;
- /* Set up the internal state */
- len = length;
- a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */
- c = level; /* the previous hash value */
+ /* Set up the internal state */
+ len = length;
+ a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */
+ c = level; /* the previous hash value */
/*---------------------------------------- handle most of the key */
- while (len >= 12)
- {
- a += (k[0] +((ub4)k[1]<<8) +((ub4)k[2]<<16) +((ub4)k[3]<<24));
- b += (k[4] +((ub4)k[5]<<8) +((ub4)k[6]<<16) +((ub4)k[7]<<24));
- c += (k[8] +((ub4)k[9]<<8) +((ub4)k[10]<<16)+((ub4)k[11]<<24));
- mix(a,b,c);
- k += 12; len -= 12;
- }
+ while (len >= 12) {
+ a += (k[0] + ((ub4) k[1] << 8) + ((ub4) k[2] << 16) +
+ ((ub4) k[3] << 24));
+ b += (k[4] + ((ub4) k[5] << 8) + ((ub4) k[6] << 16) +
+ ((ub4) k[7] << 24));
+ c += (k[8] + ((ub4) k[9] << 8) + ((ub4) k[10] << 16) +
+ ((ub4) k[11] << 24));
+ mix(a, b, c);
+ k += 12;
+ len -= 12;
+ }
/*------------------------------------- handle the last 11 bytes */
- c += length;
- switch(len) /* all the case statements fall through */
- {
- case 11: c+=((ub4)k[10]<<24);
- case 10: c+=((ub4)k[9]<<16);
- case 9 : c+=((ub4)k[8]<<8);
- /* the first byte of c is reserved for the length */
- case 8 : b+=((ub4)k[7]<<24);
- case 7 : b+=((ub4)k[6]<<16);
- case 6 : b+=((ub4)k[5]<<8);
- case 5 : b+=k[4];
- case 4 : a+=((ub4)k[3]<<24);
- case 3 : a+=((ub4)k[2]<<16);
- case 2 : a+=((ub4)k[1]<<8);
- case 1 : a+=k[0];
- /* case 0: nothing left to add */
- }
- mix(a,b,c);
+ c += length;
+ switch (len) { /* all the case statements fall through */
+ case 11:
+ c += ((ub4) k[10] << 24);
+ case 10:
+ c += ((ub4) k[9] << 16);
+ case 9:
+ c += ((ub4) k[8] << 8);
+ /* the first byte of c is reserved for the length */
+ case 8:
+ b += ((ub4) k[7] << 24);
+ case 7:
+ b += ((ub4) k[6] << 16);
+ case 6:
+ b += ((ub4) k[5] << 8);
+ case 5:
+ b += k[4];
+ case 4:
+ a += ((ub4) k[3] << 24);
+ case 3:
+ a += ((ub4) k[2] << 16);
+ case 2:
+ a += ((ub4) k[1] << 8);
+ case 1:
+ a += k[0];
+ /* case 0: nothing left to add */
+ }
+ mix(a, b, c);
/*-------------------------------------------- report the result */
- return c;
+ return c;
}
-
/*
--------------------------------------------------------------------
mixc -- mixc 8 4-bit values as quickly and thoroughly as possible.
@@ -169,78 +181,120 @@ Use to detect changes between revisions of documents, assuming nobody
is trying to cause collisions. Do NOT use for cryptography.
--------------------------------------------------------------------
*/
-void checksum( k, len, state)
+void checksum(k, len, state)
register ub1 *k;
-register ub4 len;
+register ub4 len;
register ub4 *state;
{
- register ub4 a,b,c,d,e,f,g,h,length;
+ register ub4 a, b, c, d, e, f, g, h, length;
- /* Use the length and level; add in the golden ratio. */
- length = len;
- a=state[0]; b=state[1]; c=state[2]; d=state[3];
- e=state[4]; f=state[5]; g=state[6]; h=state[7];
+ /* Use the length and level; add in the golden ratio. */
+ length = len;
+ a = state[0];
+ b = state[1];
+ c = state[2];
+ d = state[3];
+ e = state[4];
+ f = state[5];
+ g = state[6];
+ h = state[7];
/*---------------------------------------- handle most of the key */
- while (len >= 32)
- {
- a += (k[0] +(k[1]<<8) +(k[2]<<16) +(k[3]<<24));
- b += (k[4] +(k[5]<<8) +(k[6]<<16) +(k[7]<<24));
- c += (k[8] +(k[9]<<8) +(k[10]<<16)+(k[11]<<24));
- d += (k[12]+(k[13]<<8)+(k[14]<<16)+(k[15]<<24));
- e += (k[16]+(k[17]<<8)+(k[18]<<16)+(k[19]<<24));
- f += (k[20]+(k[21]<<8)+(k[22]<<16)+(k[23]<<24));
- g += (k[24]+(k[25]<<8)+(k[26]<<16)+(k[27]<<24));
- h += (k[28]+(k[29]<<8)+(k[30]<<16)+(k[31]<<24));
- mixc(a,b,c,d,e,f,g,h);
- mixc(a,b,c,d,e,f,g,h);
- mixc(a,b,c,d,e,f,g,h);
- mixc(a,b,c,d,e,f,g,h);
- k += 32; len -= 32;
- }
+ while (len >= 32) {
+ a += (k[0] + (k[1] << 8) + (k[2] << 16) + (k[3] << 24));
+ b += (k[4] + (k[5] << 8) + (k[6] << 16) + (k[7] << 24));
+ c += (k[8] + (k[9] << 8) + (k[10] << 16) + (k[11] << 24));
+ d += (k[12] + (k[13] << 8) + (k[14] << 16) + (k[15] << 24));
+ e += (k[16] + (k[17] << 8) + (k[18] << 16) + (k[19] << 24));
+ f += (k[20] + (k[21] << 8) + (k[22] << 16) + (k[23] << 24));
+ g += (k[24] + (k[25] << 8) + (k[26] << 16) + (k[27] << 24));
+ h += (k[28] + (k[29] << 8) + (k[30] << 16) + (k[31] << 24));
+ mixc(a, b, c, d, e, f, g, h);
+ mixc(a, b, c, d, e, f, g, h);
+ mixc(a, b, c, d, e, f, g, h);
+ mixc(a, b, c, d, e, f, g, h);
+ k += 32;
+ len -= 32;
+ }
/*------------------------------------- handle the last 31 bytes */
- h += length;
- switch(len)
- {
- case 31: h+=(k[30]<<24);
- case 30: h+=(k[29]<<16);
- case 29: h+=(k[28]<<8);
- case 28: g+=(k[27]<<24);
- case 27: g+=(k[26]<<16);
- case 26: g+=(k[25]<<8);
- case 25: g+=k[24];
- case 24: f+=(k[23]<<24);
- case 23: f+=(k[22]<<16);
- case 22: f+=(k[21]<<8);
- case 21: f+=k[20];
- case 20: e+=(k[19]<<24);
- case 19: e+=(k[18]<<16);
- case 18: e+=(k[17]<<8);
- case 17: e+=k[16];
- case 16: d+=(k[15]<<24);
- case 15: d+=(k[14]<<16);
- case 14: d+=(k[13]<<8);
- case 13: d+=k[12];
- case 12: c+=(k[11]<<24);
- case 11: c+=(k[10]<<16);
- case 10: c+=(k[9]<<8);
- case 9 : c+=k[8];
- case 8 : b+=(k[7]<<24);
- case 7 : b+=(k[6]<<16);
- case 6 : b+=(k[5]<<8);
- case 5 : b+=k[4];
- case 4 : a+=(k[3]<<24);
- case 3 : a+=(k[2]<<16);
- case 2 : a+=(k[1]<<8);
- case 1 : a+=k[0];
- }
- mixc(a,b,c,d,e,f,g,h);
- mixc(a,b,c,d,e,f,g,h);
- mixc(a,b,c,d,e,f,g,h);
- mixc(a,b,c,d,e,f,g,h);
+ h += length;
+ switch (len) {
+ case 31:
+ h += (k[30] << 24);
+ case 30:
+ h += (k[29] << 16);
+ case 29:
+ h += (k[28] << 8);
+ case 28:
+ g += (k[27] << 24);
+ case 27:
+ g += (k[26] << 16);
+ case 26:
+ g += (k[25] << 8);
+ case 25:
+ g += k[24];
+ case 24:
+ f += (k[23] << 24);
+ case 23:
+ f += (k[22] << 16);
+ case 22:
+ f += (k[21] << 8);
+ case 21:
+ f += k[20];
+ case 20:
+ e += (k[19] << 24);
+ case 19:
+ e += (k[18] << 16);
+ case 18:
+ e += (k[17] << 8);
+ case 17:
+ e += k[16];
+ case 16:
+ d += (k[15] << 24);
+ case 15:
+ d += (k[14] << 16);
+ case 14:
+ d += (k[13] << 8);
+ case 13:
+ d += k[12];
+ case 12:
+ c += (k[11] << 24);
+ case 11:
+ c += (k[10] << 16);
+ case 10:
+ c += (k[9] << 8);
+ case 9:
+ c += k[8];
+ case 8:
+ b += (k[7] << 24);
+ case 7:
+ b += (k[6] << 16);
+ case 6:
+ b += (k[5] << 8);
+ case 5:
+ b += k[4];
+ case 4:
+ a += (k[3] << 24);
+ case 3:
+ a += (k[2] << 16);
+ case 2:
+ a += (k[1] << 8);
+ case 1:
+ a += k[0];
+ }
+ mixc(a, b, c, d, e, f, g, h);
+ mixc(a, b, c, d, e, f, g, h);
+ mixc(a, b, c, d, e, f, g, h);
+ mixc(a, b, c, d, e, f, g, h);
/*-------------------------------------------- report the result */
- state[0]=a; state[1]=b; state[2]=c; state[3]=d;
- state[4]=e; state[5]=f; state[6]=g; state[7]=h;
+ state[0] = a;
+ state[1] = b;
+ state[2] = c;
+ state[3] = d;
+ state[4] = e;
+ state[5] = f;
+ state[6] = g;
+ state[7] = h;
}
generated by cgit v1.2.3 (git 2.25.1) at 2024-09-28 12:25:15 +0000