Lines Matching +full:6 +full:d

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
21  *	return (a<<11) + (b<<6) + (c<<3) - b;
43 	/* Phase 2: Compute (a << 11) + (b << 6) + (c << 3) - b */  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()
66 	b += a;		/* 1  6 */  in __hash_32()
70 	d = c << 7;	/* 7 18 */  in __hash_32()
71 	d += b;		/* 1 19 */  in __hash_32()
72 	d <<= 8;	/* 8 27 */  in __hash_32()
73 	d += a;		/* 1 28 */  in __hash_32()
74 	d <<= 1;	/* 1 29 */  in __hash_32()
75 	d += b;		/* 1 30 */  in __hash_32()
76 	d <<= 6;	/* 6 36 */  in __hash_32()
77 	return d + c;	/* 1 37 total instructions*/  in __hash_32()