14  * These are functions for producing 32-bit hashes for hash table lookup.
34 /* __jhash_mix -- mix 3 32-bit values reversibly. */
45 /* __jhash_final - final mixing of 3 32-bit values (a,b,c) into c */
61  * @k: sequence of bytes as key
73 	const u8 *k = key;  in jhash()  local
78 	/* All but the last block: affect some 32 bits of (a,b,c) */  in jhash()
80 		a += __get_unaligned_cpu32(k);  in jhash()
81 		b += __get_unaligned_cpu32(k + 4);  in jhash()
82 		c += __get_unaligned_cpu32(k + 8);  in jhash()
85 		k += 12;  in jhash()
87 	/* Last block: affect all 32 bits of (c) */  in jhash()
90 	case 12: c += (u32)k[11]<<24;  in jhash()
91 	case 11: c += (u32)k[10]<<16;  in jhash()
92 	case 10: c += (u32)k[9]<<8;  in jhash()
93 	case 9:  c += k[8];  in jhash()
94 	case 8:  b += (u32)k[7]<<24;  in jhash()
95 	case 7:  b += (u32)k[6]<<16;  in jhash()
96 	case 6:  b += (u32)k[5]<<8;  in jhash()
97 	case 5:  b += k[4];  in jhash()
98 	case 4:  a += (u32)k[3]<<24;  in jhash()
99 	case 3:  a += (u32)k[2]<<16;  in jhash()
100 	case 2:  a += (u32)k[1]<<8;  in jhash()
101 	case 1:  a += k[0];  in jhash()
111  * @k: the key which must be an array of u32's
117 static inline u32 jhash2(const u32 *k, u32 length, u32 initval)  in jhash2()  argument
126 		a += k[0];  in jhash2()
127 		b += k[1];  in jhash2()
128 		c += k[2];  in jhash2()
131 		k += 3;  in jhash2()
136 	case 3: c += k[2];  in jhash2()
137 	case 2: b += k[1];  in jhash2()
138 	case 1: a += k[0];  in jhash2()