Re: [PrimeNumbers] How fast is your GCD code? Here's mine...
- From: Jack Brennen <jfb@...>
> Apologies once again, but I don'tA noble aim. So why did you overlook this:
> want to leave broken code out there...
> >> int64 d;Which is classic UB.
> >> d&= d>>63; //where 63+1=wordsize of uint64s
- From: WarrenS <warren.wds@...>
> > > b -= d+d+a;It's a sparse enough inner loop that I can easily imagine the increased dependency makes it slower. What's the latency of an add nowadays? I know it's crept up to about 6 in the past decade (at least on the SIMD units). Something like that's a huge bubble, and should definitely be avoided.
> > > a += d; //the obvious "optimization" of this
> & previous line... makes it slower!
> > > (...)
> > I can't imagine that
> > a += d ; b -= d+a
> > would be slower.
> --it is slower! On my computer, anyhow.