Created
September 1, 2012 10:12
-
-
Save soywiz/3568771 to your computer and use it in GitHub Desktop.
HAXE: Divide an integer expression by an integer constant (it converts the division into a multiplication and a shift)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class MathEx { | |
/** | |
* Divide the first integer expression by the second constant integer value. | |
* It will just work with numerator being and unsigned short value (0x0000-0xFFFF) | |
* | |
* @param numerator Unsigned short numerator value | |
* @param denominator Constant denominator value | |
* @return | |
*/ | |
@:macro static public function fastUintConstDiv16(numerator:Expr, denominator:Int):Expr { | |
var result = _magicu2_bits(denominator, 16); | |
var mult:Expr = { expr : EConst(CInt(Std.string(result.magic))), pos : Context.currentPos() }; | |
var shift:Expr = { expr : EConst(CInt(Std.string(result.shift))), pos : Context.currentPos() }; | |
var mult2:Expr = { expr : EBinop(OpMult, numerator, mult), pos : Context.currentPos() }; | |
var combined:Expr = { expr : EBinop(OpUShr, mult2, shift), pos : Context.currentPos() }; | |
return combined; | |
} | |
/** | |
* | |
* @param d | |
* @param bits | |
* @return | |
* | |
* @see http://www.hackersdelight.org/magic.htm | |
* @see http://research.swtch.com/divmult | |
*/ | |
static private inline function _magicu2_bits(d:Int, bits:Int):Dynamic { | |
var mask2:Int = ((1 << (bits - 1))); | |
var mask:Int = ((1 << (bits - 1)) - 1); | |
var p:Int; | |
var p32:Int = 0, q:Int, r:Int, delta:Int; | |
var add:Int = 0; // Initialize "add" indicator. | |
p = bits - 1; // Initialize p. | |
q = Std.int(mask / d); // Initialize q = (2**p - 1)/d. | |
r = mask - q*d; // Init. r = rem(2**p - 1, d). | |
do { | |
p = p + 1; | |
if (p == bits) { | |
p32 = 1; // Set p32 = 2**(p-32). | |
} | |
else { | |
p32 = 2 * p32; | |
} | |
if (r + 1 >= d - r) { | |
if (q >= mask) add = 1; | |
q = 2*q + 1; // Update q. | |
r = 2*r + 1 - d; // Update r. | |
} | |
else { | |
if (q >= mask2) add = 1; | |
q = 2*q; | |
r = 2*r + 1; | |
} | |
delta = d - 1 - r; | |
} while (p < (bits * 2) && p32 < delta); | |
return { | |
magic : q + 1, | |
shift : p, | |
add : add, | |
}; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment