### Please enter an index vector (0..31 or $0..$1f, or * for don't care):

Best method found: Bit group moving (about 38 cycles on superscalar processors):

x = ((x & 0x00042200) << 6)
| ((x & 0x01200000) << 7)
| rol(x & 0x10000011, 8)
| ((x & 0x00000080) << 10)
| ((x & 0x08000000) >> 21)
| ((x & 0x00001000) << 13)
| rol(x & 0x00180102, 15)
| ((x & 0x40000000) >> 16)
| ((x & 0x00008000) >> 15)
| ((x & 0x02000000) >> 14)
| ((x & 0x00000400) << 19)
| rol(x & 0x00400004, 20)
| ((x & 0x80000000) >> 11)
| ((x & 0x00000020) << 22)
| ((x & 0x00010000) >> 9)
| ((x & 0x00000800) >> 6)
| rol(x & 0x04804048, 27)
| ((x & 0x00020000) >> 4)
| ((x & 0x20000000) >> 3);

See documentation to
bit_permute_step,
bit_permute_step_simple,
rol.

pext and pdep
can be emulated with
compress_right
and
expand_right.

This result is not necessarily the best possible,
but at least several methods have been challenged.
The given cycles are only estimated and may vary significantly
depending on the used processor.
Thus, the selected method might not be the best one for your application.
You can however influence the choice by using the options above.

See also some
notes
on the inner workings.

There is an even better permutation code calculator
**calcperm.***
which is usable for various word sizes
(Pascal and C++ sources).

Error reports, comments or questions? E-mail:
info@sirrida.de

You may
bookmark
this page as
http://programming.sirrida.de?calcperm.php.

Last change: 2015-11-10