12  * this 6-step solution was found by Yevgen Voronenko's implementation
17  * 6-shift, 6-add sequences for computing x * 0x61C88647.  They are all
20  *	b = (x << 23) + a;
21  *	return (a<<11) + (b<<6) + (c<<3) - b;
35 	unsigned int b, c;  in __hash_32()  local
38 	b =  a << 23;  in __hash_32()
41 	b += a;  in __hash_32()
43 	/* Phase 2: Compute (a << 11) + (b << 6) + (c << 3) - b */  in __hash_32()
45 	a += b;		/* (a << 5) + b */  in __hash_32()
47 	a += c;		/* (a << 8) + (b << 3) + c */  in __hash_32()
49 	return a - b;	/* (a << 11) + (b << 6) + (c << 3) - b */  in __hash_32()
62 	unsigned int b, c, d;  in __hash_32()
64 	b = a << 4;	/* 4    */  in __hash_32()
65 	c = b << 1;	/* 1  5 */  in __hash_32()
66 	b += a;		/* 1  6 */  in __hash_32()
67 	c += b;		/* 1  7 */  in __hash_32()
71 	d += b;		/* 1 19 */  in __hash_32()
75 	d += b;		/* 1 30 */  in __hash_32()
76 	d <<= 6;	/* 6 36 */  in __hash_32()