News for hackers. Stuff that matters.
Re:Calculating integer factorials in constant time, taking a... by scott_s on Tuesday December 15, 2015 @01:16PM (#10739377)
Dude, this outperformed log2 by a large margin, which is what I cared about. Cycles mattered in this code, but after this optimization, that's not where most cycles were being spent.

edit: Investigating further, this intrinsic was introduced into gcc around 2006, which means I'm not sure it would have been available to me at the time.

There are no comments on this comment yet.