Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | "Rick C. Hodgin" <rick.c.hodgin@gmail.com> |
|---|---|
| Newsgroups | comp.arch, comp.lang.c, comp.arch.fpga |
| Subject | Re: Bit swizzling |
| Date | 2020-09-06 12:30 -0400 |
| Organization | Liberty Software Foundation |
| Message-ID | <0a520b8e-5d3a-2bf7-ebaf-9c05eea38283@gmail.com> (permalink) |
| References | <20-09-014@comp.compilers> <20-09-018@comp.compilers> |
Cross-posted to 3 groups.
On 9/6/20 3:31 AM, davidlovemore@gmail.com wrote: > On Saturday, September 5, 2020 at 5:45:43 PM UTC+1, Rick C. Hodgin wrote: >> Are there any algorithms which take a known-at-compile-time sequence >> of bitwise operations on an 8-bit to 64-bit quantity, and optimize >> them down to their minimal set of operations? > > There's some good resources on bit permutations including this online calculator here: > http://programming.sirrida.de/calcperm.php > > Source code for a more sophisticated permutation code generator is also available linked from the page. > > Some notes here on the online generator: > http://programming.sirrida.de/bit_perm.html#calculator Exactly what was I looking for. Thank you. -- Rick C. Hodgin
Back to comp.arch | Previous | Next | Find similar
Re: Bit swizzling "Rick C. Hodgin" <rick.c.hodgin@gmail.com> - 2020-09-06 12:30 -0400
csiph-web