News for hackers. Stuff that matters.
Re:AS3 Bitwise gems - fast integer math by swolchok on Sunday May 24, 2009 @05:00PM (#624673)
This isn't even "modern" in compiler terms, it's a simple peephole optimization. (grep through the IR, check for "X / 2^n", replace by "X >> n") To get it right when you have

    int a;
    int b = 64;
    a / b
requires dataflow analysis so you can do constant propagation, copy propagation, and dead code elimination. This is more work to get right, but that's not a very good excuse for not at least doing the peephole optimization.

There are no comments on this comment yet.