Lines Matching +full:phase +full:- +full:shift

1 /* SPDX-License-Identifier: GPL-2.0 */
11  * multiply using shifts and adds.  GCC can find a 9-step solution, but
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;
37 	/* Phase 1: Compute three intermediate values */  in __hash_32()
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()
56 	 * addition-subtraction chain.  This one is not known to be  in __hash_32()
57 	 * optimal, but at 37 steps, it's decent for a 31-bit multiplier.  in __hash_32()
69 	c -= a;		/* 1 11 */  in __hash_32()