By: none (none.delete@this.none.com), January 13, 2021 1:11 am
Room: Moderated Discussions
hobold (hobold.delete@this.vectorizer.org) on January 12, 2021 2:51 pm wrote:
> none (none.delete@this.none.com) on January 12, 2021 3:53 am wrote:
>
> [...]
> > As long as you don't need a 128-bit result, yes. I wonder what workload beyond bignum
> > requires 2 integer multiplication per 8 instructions.
>
> If you are not limited by power / heat, integer multiply can be a fast
> way to do all kinds of bit permutation trickery. Some examples here:
>
> Bit Twiddling Hacks
Thanks! This reminds me that some bitboard manipulations in Chess and Othello can use
multiplications too.
> none (none.delete@this.none.com) on January 12, 2021 3:53 am wrote:
>
> [...]
> > As long as you don't need a 128-bit result, yes. I wonder what workload beyond bignum
> > requires 2 integer multiplication per 8 instructions.
>
> If you are not limited by power / heat, integer multiply can be a fast
> way to do all kinds of bit permutation trickery. Some examples here:
>
> Bit Twiddling Hacks
Thanks! This reminds me that some bitboard manipulations in Chess and Othello can use
multiplications too.