Lines Matching refs:k
56 #define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k)))) argument
186 const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */ in hashlittle() local
192 a += k[0]; in hashlittle()
193 b += k[1]; in hashlittle()
194 c += k[2]; in hashlittle()
197 k += 3; in hashlittle()
215 case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; in hashlittle()
216 case 11: c+=k[2]&0xffffff; b+=k[1]; a+=k[0]; break; in hashlittle()
217 case 10: c+=k[2]&0xffff; b+=k[1]; a+=k[0]; break; in hashlittle()
218 case 9 : c+=k[2]&0xff; b+=k[1]; a+=k[0]; break; in hashlittle()
219 case 8 : b+=k[1]; a+=k[0]; break; in hashlittle()
220 case 7 : b+=k[1]&0xffffff; a+=k[0]; break; in hashlittle()
221 case 6 : b+=k[1]&0xffff; a+=k[0]; break; in hashlittle()
222 case 5 : b+=k[1]&0xff; a+=k[0]; break; in hashlittle()
223 case 4 : a+=k[0]; break; in hashlittle()
224 case 3 : a+=k[0]&0xffffff; break; in hashlittle()
225 case 2 : a+=k[0]&0xffff; break; in hashlittle()
226 case 1 : a+=k[0]&0xff; break; in hashlittle()
232 k8 = (const uint8_t *)k; in hashlittle()
235 case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; in hashlittle()
239 case 8 : b+=k[1]; a+=k[0]; break; in hashlittle()
243 case 4 : a+=k[0]; break; in hashlittle()
253 const uint16_t *k = (const uint16_t *)key; /* read 16-bit chunks */ in hashlittle() local
259 a += k[0] + (((uint32_t)k[1])<<16); in hashlittle()
260 b += k[2] + (((uint32_t)k[3])<<16); in hashlittle()
261 c += k[4] + (((uint32_t)k[5])<<16); in hashlittle()
264 k += 6; in hashlittle()
268 k8 = (const uint8_t *)k; in hashlittle()
271 case 12: c+=k[4]+(((uint32_t)k[5])<<16); in hashlittle()
272 b+=k[2]+(((uint32_t)k[3])<<16); in hashlittle()
273 a+=k[0]+(((uint32_t)k[1])<<16); in hashlittle()
276 case 10: c+=k[4]; in hashlittle()
277 b+=k[2]+(((uint32_t)k[3])<<16); in hashlittle()
278 a+=k[0]+(((uint32_t)k[1])<<16); in hashlittle()
281 case 8 : b+=k[2]+(((uint32_t)k[3])<<16); in hashlittle()
282 a+=k[0]+(((uint32_t)k[1])<<16); in hashlittle()
285 case 6 : b+=k[2]; in hashlittle()
286 a+=k[0]+(((uint32_t)k[1])<<16); in hashlittle()
289 case 4 : a+=k[0]+(((uint32_t)k[1])<<16); in hashlittle()
292 case 2 : a+=k[0]; in hashlittle()
300 const uint8_t *k = (const uint8_t *)key; in hashlittle() local
305 a += k[0]; in hashlittle()
306 a += ((uint32_t)k[1])<<8; in hashlittle()
307 a += ((uint32_t)k[2])<<16; in hashlittle()
308 a += ((uint32_t)k[3])<<24; in hashlittle()
309 b += k[4]; in hashlittle()
310 b += ((uint32_t)k[5])<<8; in hashlittle()
311 b += ((uint32_t)k[6])<<16; in hashlittle()
312 b += ((uint32_t)k[7])<<24; in hashlittle()
313 c += k[8]; in hashlittle()
314 c += ((uint32_t)k[9])<<8; in hashlittle()
315 c += ((uint32_t)k[10])<<16; in hashlittle()
316 c += ((uint32_t)k[11])<<24; in hashlittle()
319 k += 12; in hashlittle()
325 case 12: c+=((uint32_t)k[11])<<24; /* fall through */ in hashlittle()
326 case 11: c+=((uint32_t)k[10])<<16; /* fall through */ in hashlittle()
327 case 10: c+=((uint32_t)k[9])<<8; /* fall through */ in hashlittle()
328 case 9 : c+=k[8]; /* fall through */ in hashlittle()
329 case 8 : b+=((uint32_t)k[7])<<24; /* fall through */ in hashlittle()
330 case 7 : b+=((uint32_t)k[6])<<16; /* fall through */ in hashlittle()
331 case 6 : b+=((uint32_t)k[5])<<8; /* fall through */ in hashlittle()
332 case 5 : b+=k[4]; /* fall through */ in hashlittle()
333 case 4 : a+=((uint32_t)k[3])<<24; /* fall through */ in hashlittle()
334 case 3 : a+=((uint32_t)k[2])<<16; /* fall through */ in hashlittle()
335 case 2 : a+=((uint32_t)k[1])<<8; /* fall through */ in hashlittle()
336 case 1 : a+=k[0]; in hashlittle()
363 const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */ in hashbig() local
369 a += k[0]; in hashbig()
370 b += k[1]; in hashbig()
371 c += k[2]; in hashbig()
374 k += 3; in hashbig()
392 case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; in hashbig()
393 case 11: c+=k[2]&0xffffff00; b+=k[1]; a+=k[0]; break; in hashbig()
394 case 10: c+=k[2]&0xffff0000; b+=k[1]; a+=k[0]; break; in hashbig()
395 case 9 : c+=k[2]&0xff000000; b+=k[1]; a+=k[0]; break; in hashbig()
396 case 8 : b+=k[1]; a+=k[0]; break; in hashbig()
397 case 7 : b+=k[1]&0xffffff00; a+=k[0]; break; in hashbig()
398 case 6 : b+=k[1]&0xffff0000; a+=k[0]; break; in hashbig()
399 case 5 : b+=k[1]&0xff000000; a+=k[0]; break; in hashbig()
400 case 4 : a+=k[0]; break; in hashbig()
401 case 3 : a+=k[0]&0xffffff00; break; in hashbig()
402 case 2 : a+=k[0]&0xffff0000; break; in hashbig()
403 case 1 : a+=k[0]&0xff000000; break; in hashbig()
409 k8 = (const uint8_t *)k; in hashbig()
412 case 12: c+=k[2]; b+=k[1]; a+=k[0]; break; in hashbig()
416 case 8 : b+=k[1]; a+=k[0]; break; in hashbig()
420 case 4 : a+=k[0]; break; in hashbig()
430 const uint8_t *k = (const uint8_t *)key; in hashbig() local
435 a += ((uint32_t)k[0])<<24; in hashbig()
436 a += ((uint32_t)k[1])<<16; in hashbig()
437 a += ((uint32_t)k[2])<<8; in hashbig()
438 a += ((uint32_t)k[3]); in hashbig()
439 b += ((uint32_t)k[4])<<24; in hashbig()
440 b += ((uint32_t)k[5])<<16; in hashbig()
441 b += ((uint32_t)k[6])<<8; in hashbig()
442 b += ((uint32_t)k[7]); in hashbig()
443 c += ((uint32_t)k[8])<<24; in hashbig()
444 c += ((uint32_t)k[9])<<16; in hashbig()
445 c += ((uint32_t)k[10])<<8; in hashbig()
446 c += ((uint32_t)k[11]); in hashbig()
449 k += 12; in hashbig()
455 case 12: c+=k[11]; /* fall through */ in hashbig()
456 case 11: c+=((uint32_t)k[10])<<8; /* fall through */ in hashbig()
457 case 10: c+=((uint32_t)k[9])<<16; /* fall through */ in hashbig()
458 case 9 : c+=((uint32_t)k[8])<<24; /* fall through */ in hashbig()
459 case 8 : b+=k[7]; /* fall through */ in hashbig()
460 case 7 : b+=((uint32_t)k[6])<<8; /* fall through */ in hashbig()
461 case 6 : b+=((uint32_t)k[5])<<16; /* fall through */ in hashbig()
462 case 5 : b+=((uint32_t)k[4])<<24; /* fall through */ in hashbig()
463 case 4 : a+=k[3]; /* fall through */ in hashbig()
464 case 3 : a+=((uint32_t)k[2])<<8; /* fall through */ in hashbig()
465 case 2 : a+=((uint32_t)k[1])<<16; /* fall through */ in hashbig()
466 case 1 : a+=((uint32_t)k[0])<<24; /* fall through */ in hashbig()