Re: Bit swizzling

"Rick C. Hodgin" <>
Thu, 10 Sep 2020 17:13:24 -0400

          From comp.compilers

Related articles
[5 earlier articles]
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)
Re: Bit swizzling (Tom Crick) (2020-09-08)
Re: Bit swizzling (gah4) (2020-09-10)
Re: Bit swizzling (Rick C. Hodgin) (2020-09-10)
| List of all articles for this month |

From: "Rick C. Hodgin" <>
Newsgroups: comp.compilers
Date: Thu, 10 Sep 2020 17:13:24 -0400
Organization: Liberty Software Foundation
References: 20-09-014 20-09-026
Injection-Info:; posting-host=""; logging-data="64204"; mail-complaints-to=""
Keywords: optimize
Posted-Date: 10 Sep 2020 20:12:59 EDT
In-Reply-To: 20-09-026
Content-Language: en-US

On 9/10/20 1:34 PM, gah4 wrote:
> On Saturday, September 5, 2020 at 9:45:43 AM UTC-7, 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 is a lot of work, and many algorithms, for logic optimization,
> or minimization, that, for example, will find the optimal combination
> of NAND and NOR gates to evaluate some logical operation. ...

I have a preliminary algorithm that works, but it's still not fully
optimized and is a little clunky.

I want a way to abstract the logic and work with it there.

I haven't put in any additional time on this algorithm yet, due to
some life things happening. But I plan to come back to it.

Rick C. Hodgin

Post a followup to this message

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