Lines Matching +full:10 +full:k
35 b -= c; b -= a; b ^= (a<<10); \
49 const u8 *k = key; in jhash() local
56 a += (k[0] +((u32)k[1]<<8) +((u32)k[2]<<16) +((u32)k[3]<<24)); in jhash()
57 b += (k[4] +((u32)k[5]<<8) +((u32)k[6]<<16) +((u32)k[7]<<24)); in jhash()
58 c += (k[8] +((u32)k[9]<<8) +((u32)k[10]<<16)+((u32)k[11]<<24)); in jhash()
62 k += 12; in jhash()
68 case 11: c += ((u32)k[10]<<24); in jhash()
69 case 10: c += ((u32)k[9]<<16); in jhash()
70 case 9 : c += ((u32)k[8]<<8); in jhash()
71 case 8 : b += ((u32)k[7]<<24); in jhash()
72 case 7 : b += ((u32)k[6]<<16); in jhash()
73 case 6 : b += ((u32)k[5]<<8); in jhash()
74 case 5 : b += k[4]; in jhash()
75 case 4 : a += ((u32)k[3]<<24); in jhash()
76 case 3 : a += ((u32)k[2]<<16); in jhash()
77 case 2 : a += ((u32)k[1]<<8); in jhash()
78 case 1 : a += k[0]; in jhash()
89 static inline u32 jhash2(const u32 *k, u32 length, u32 initval) in jhash2() argument
98 a += k[0]; in jhash2()
99 b += k[1]; in jhash2()
100 c += k[2]; in jhash2()
102 k += 3; len -= 3; in jhash2()
108 case 2 : b += k[1]; in jhash2()
109 case 1 : a += k[0]; in jhash2()