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
18  *	c = (x << 19) + x;
19  *	a = (x <<  9) + c;
21  *	return (a<<11) + (b<<6) + (c<<3) - b;
35 	unsigned int b, c;  in __hash_32()  local
39 	c = (a << 19) + a;  in __hash_32()
40 	a = (a <<  9) + c;  in __hash_32()
43 	/* Phase 2: Compute (a << 11) + (b << 6) + (c << 3) - 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()
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()
68 	c <<= 3;	/* 3 10 */  in __hash_32()
69 	c -= a;		/* 1 11 */  in __hash_32()
70 	d = c << 7;	/* 7 18 */  in __hash_32()
76 	d <<= 6;	/* 6 36 */  in __hash_32()
77 	return d + c;	/* 1 37 total instructions*/  in __hash_32()