Re: Bit Swizzling

"John Levine" <>
5 Sep 2020 18:50:16 -0000

          From comp.compilers

Related articles
Bit swizzling (Rick C. Hodgin) (2020-09-05)
Re: Bit swizzling (Hans-Peter Diettrich) (2020-09-05)
Re: Bit Swizzling (John Levine) (2020-09-05)
Re: Bit swizzling (Kaz Kylheku) (2020-09-05)
Re: Bit swizzling ( (2020-09-06)
Re: Bit Swizzling (Chris) (2020-09-06)
Re: Bit swizzling (Martin Ward) (2020-09-07)
Re: Bit swizzling (Rick C. Hodgin) (2020-09-07)
Re: Bit swizzling (Hans-Peter Diettrich) (2020-09-08)
[3 later articles]
| List of all articles for this month |

From: "John Levine" <>
Newsgroups: comp.arch,comp.compilers
Date: 5 Sep 2020 18:50:16 -0000
Organization: Taughannock Networks
References: <riumcj$3j9$> <rivvah$1neg$> 20-09-014
Injection-Info:; posting-host=""; logging-data="1888"; mail-complaints-to=""
Keywords: optimize
Posted-Date: 05 Sep 2020 14:52:13 EDT
Cleverness: some

In article <rivvah$1neg$>,
>> -----
>> 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?

>Why not just use a lookup table ?. Minimum ops and fast...

Assuming you're looking for something you can implement in logic
rather than by table lookup, it sounds like a set of Karnaugh maps.

John Levine,, Primary Perpetrator of "The Internet for Dummies",
Please consider the environment before reading this e-mail.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.