Lines Matching +full:10 +full:k
44 #define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k)))) argument
67 Some k values for my "a-=c; a^=rot(c,k); c+=b;" arrangement that
121 10 8 15 26 3 22 24
150 const uint32_t *k, /* the key, an array of uint32_t values */ in jenkins_hash32() argument
162 a += k[0]; in jenkins_hash32()
163 b += k[1]; in jenkins_hash32()
164 c += k[2]; in jenkins_hash32()
167 k += 3; in jenkins_hash32()
173 case 3 : c+=k[2]; in jenkins_hash32()
174 case 2 : b+=k[1]; in jenkins_hash32()
175 case 1 : a+=k[0]; in jenkins_hash32()
188 k : the key (the unaligned variable-length array of bytes)
197 use a bitmask. For example, if you need only 10 bits, do
198 h = (h & hashmask(10));
199 In which case, the hash table should have hashsize(10) elements.
201 If you are hashing n strings (uint8_t **)k, do it like this:
202 for (i=0, h=0; i<n; ++i) h = hashlittle( k[i], len[i], h);
222 const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */ in jenkins_hash() local
227 a += k[0]; in jenkins_hash()
228 b += k[1]; in jenkins_hash()
229 c += k[2]; in jenkins_hash()
232 k += 3; in jenkins_hash()
237 * "k[2]&0xffffff" actually reads beyond the end of the string, but in jenkins_hash()
248 case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; in jenkins_hash()
249 case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; in jenkins_hash()
250 case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; in jenkins_hash()
251 case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; in jenkins_hash()
252 case 8 : b+=k[1]; a+=k[0]; break; in jenkins_hash()
253 case 7 : b+=k[1]&0xffffff; a+=k[0]; break; in jenkins_hash()
254 case 6 : b+=k[1]&0xffff; a+=k[0]; break; in jenkins_hash()
255 case 5 : b+=k[1]&0xff; a+=k[0]; break; in jenkins_hash()
256 case 4 : a+=k[0]; break; in jenkins_hash()
257 case 3 : a+=k[0]&0xffffff; break; in jenkins_hash()
258 case 2 : a+=k[0]&0xffff; break; in jenkins_hash()
259 case 1 : a+=k[0]&0xff; break; in jenkins_hash()
264 const uint16_t *k = (const uint16_t *)key; /* read 16-bit chunks */ in jenkins_hash() local
270 a += k[0] + (((uint32_t)k[1])<<16); in jenkins_hash()
271 b += k[2] + (((uint32_t)k[3])<<16); in jenkins_hash()
272 c += k[4] + (((uint32_t)k[5])<<16); in jenkins_hash()
275 k += 6; in jenkins_hash()
279 k8 = (const uint8_t *)k; in jenkins_hash()
282 case 12: c+=k[4]+(((uint32_t)k[5])<<16); in jenkins_hash()
283 b+=k[2]+(((uint32_t)k[3])<<16); in jenkins_hash()
284 a+=k[0]+(((uint32_t)k[1])<<16); in jenkins_hash()
286 case 11: c+=((uint32_t)k8[10])<<16; /* fall through */ in jenkins_hash()
287 case 10: c+=k[4]; in jenkins_hash()
288 b+=k[2]+(((uint32_t)k[3])<<16); in jenkins_hash()
289 a+=k[0]+(((uint32_t)k[1])<<16); in jenkins_hash()
292 case 8 : b+=k[2]+(((uint32_t)k[3])<<16); in jenkins_hash()
293 a+=k[0]+(((uint32_t)k[1])<<16); in jenkins_hash()
296 case 6 : b+=k[2]; in jenkins_hash()
297 a+=k[0]+(((uint32_t)k[1])<<16); in jenkins_hash()
300 case 4 : a+=k[0]+(((uint32_t)k[1])<<16); in jenkins_hash()
303 case 2 : a+=k[0]; in jenkins_hash()
311 const uint8_t *k = (const uint8_t *)key; in jenkins_hash() local
316 a += k[0]; in jenkins_hash()
317 a += ((uint32_t)k[1])<<8; in jenkins_hash()
318 a += ((uint32_t)k[2])<<16; in jenkins_hash()
319 a += ((uint32_t)k[3])<<24; in jenkins_hash()
320 b += k[4]; in jenkins_hash()
321 b += ((uint32_t)k[5])<<8; in jenkins_hash()
322 b += ((uint32_t)k[6])<<16; in jenkins_hash()
323 b += ((uint32_t)k[7])<<24; in jenkins_hash()
324 c += k[8]; in jenkins_hash()
325 c += ((uint32_t)k[9])<<8; in jenkins_hash()
326 c += ((uint32_t)k[10])<<16; in jenkins_hash()
327 c += ((uint32_t)k[11])<<24; in jenkins_hash()
330 k += 12; in jenkins_hash()
336 case 12: c+=((uint32_t)k[11])<<24; in jenkins_hash()
337 case 11: c+=((uint32_t)k[10])<<16; in jenkins_hash()
338 case 10: c+=((uint32_t)k[9])<<8; in jenkins_hash()
339 case 9 : c+=k[8]; in jenkins_hash()
340 case 8 : b+=((uint32_t)k[7])<<24; in jenkins_hash()
341 case 7 : b+=((uint32_t)k[6])<<16; in jenkins_hash()
342 case 6 : b+=((uint32_t)k[5])<<8; in jenkins_hash()
343 case 5 : b+=k[4]; in jenkins_hash()
344 case 4 : a+=((uint32_t)k[3])<<24; in jenkins_hash()
345 case 3 : a+=((uint32_t)k[2])<<16; in jenkins_hash()
346 case 2 : a+=((uint32_t)k[1])<<8; in jenkins_hash()
347 case 1 : a+=k[0]; in jenkins_hash()
375 const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */ in jenkins_hash() local
380 a += k[0]; in jenkins_hash()
381 b += k[1]; in jenkins_hash()
382 c += k[2]; in jenkins_hash()
385 k += 3; in jenkins_hash()
390 * "k[2]<<8" actually reads beyond the end of the string, but in jenkins_hash()
401 case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; in jenkins_hash()
402 case 11: c+=k[2]&0xffffff00; b+=k[1]; a+=k[0]; break; in jenkins_hash()
403 case 10: c+=k[2]&0xffff0000; b+=k[1]; a+=k[0]; break; in jenkins_hash()
404 case 9 : c+=k[2]&0xff000000; b+=k[1]; a+=k[0]; break; in jenkins_hash()
405 case 8 : b+=k[1]; a+=k[0]; break; in jenkins_hash()
406 case 7 : b+=k[1]&0xffffff00; a+=k[0]; break; in jenkins_hash()
407 case 6 : b+=k[1]&0xffff0000; a+=k[0]; break; in jenkins_hash()
408 case 5 : b+=k[1]&0xff000000; a+=k[0]; break; in jenkins_hash()
409 case 4 : a+=k[0]; break; in jenkins_hash()
410 case 3 : a+=k[0]&0xffffff00; break; in jenkins_hash()
411 case 2 : a+=k[0]&0xffff0000; break; in jenkins_hash()
412 case 1 : a+=k[0]&0xff000000; break; in jenkins_hash()
417 const uint8_t *k = (const uint8_t *)key; in jenkins_hash() local
422 a += ((uint32_t)k[0])<<24; in jenkins_hash()
423 a += ((uint32_t)k[1])<<16; in jenkins_hash()
424 a += ((uint32_t)k[2])<<8; in jenkins_hash()
425 a += ((uint32_t)k[3]); in jenkins_hash()
426 b += ((uint32_t)k[4])<<24; in jenkins_hash()
427 b += ((uint32_t)k[5])<<16; in jenkins_hash()
428 b += ((uint32_t)k[6])<<8; in jenkins_hash()
429 b += ((uint32_t)k[7]); in jenkins_hash()
430 c += ((uint32_t)k[8])<<24; in jenkins_hash()
431 c += ((uint32_t)k[9])<<16; in jenkins_hash()
432 c += ((uint32_t)k[10])<<8; in jenkins_hash()
433 c += ((uint32_t)k[11]); in jenkins_hash()
436 k += 12; in jenkins_hash()
442 case 12: c+=k[11]; in jenkins_hash()
443 case 11: c+=((uint32_t)k[10])<<8; in jenkins_hash()
444 case 10: c+=((uint32_t)k[9])<<16; in jenkins_hash()
445 case 9 : c+=((uint32_t)k[8])<<24; in jenkins_hash()
446 case 8 : b+=k[7]; in jenkins_hash()
447 case 7 : b+=((uint32_t)k[6])<<8; in jenkins_hash()
448 case 6 : b+=((uint32_t)k[5])<<16; in jenkins_hash()
449 case 5 : b+=((uint32_t)k[4])<<24; in jenkins_hash()
450 case 4 : a+=k[3]; in jenkins_hash()
451 case 3 : a+=((uint32_t)k[2])<<8; in jenkins_hash()
452 case 2 : a+=((uint32_t)k[1])<<16; in jenkins_hash()
453 case 1 : a+=((uint32_t)k[0])<<24; in jenkins_hash()