Re: Branch-less, loop-less "Move" implementations for MMs

> Anybody interested in starting a sub-challenge for a "Move" implementation
> dedicated to memory managers, that would have neither branches nor loops?
>[...]
> Work would thus essentially focus on identifying the most efficient
> instruction patterns for given transfer sizes/CPU combinations.

That's a very interesting topic, I've already done some experiments myself
in this direction, but generally usable code yet.

Cheers,
Thorsten


.