Lines Matching +full:10 +full:k
28 b -= c; b -= a; b ^= (a<<10); \
42 const u8 *k = key; in jhash() local
49 a += (k[0] +((u32)k[1]<<8) +((u32)k[2]<<16) +((u32)k[3]<<24)); in jhash()
50 b += (k[4] +((u32)k[5]<<8) +((u32)k[6]<<16) +((u32)k[7]<<24)); in jhash()
51 c += (k[8] +((u32)k[9]<<8) +((u32)k[10]<<16)+((u32)k[11]<<24)); in jhash()
55 k += 12; in jhash()
61 case 11: c += ((u32)k[10]<<24); in jhash()
62 case 10: c += ((u32)k[9]<<16); in jhash()
63 case 9 : c += ((u32)k[8]<<8); in jhash()
64 case 8 : b += ((u32)k[7]<<24); in jhash()
65 case 7 : b += ((u32)k[6]<<16); in jhash()
66 case 6 : b += ((u32)k[5]<<8); in jhash()
67 case 5 : b += k[4]; in jhash()
68 case 4 : a += ((u32)k[3]<<24); in jhash()
69 case 3 : a += ((u32)k[2]<<16); in jhash()
70 case 2 : a += ((u32)k[1]<<8); in jhash()
71 case 1 : a += k[0]; in jhash()
82 static inline u32 jhash2(u32 *k, u32 length, u32 initval) in jhash2() argument
91 a += k[0]; in jhash2()
92 b += k[1]; in jhash2()
93 c += k[2]; in jhash2()
95 k += 3; len -= 3; in jhash2()
101 case 2 : b += k[1]; in jhash2()
102 case 1 : a += k[0]; in jhash2()