Re: [PATCH 3/9] simplify ((A & M) | B ) & M' even when (M & M') != 0

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On Thu, Aug 9, 2018 at 4:15 PM Luc Van Oostenryck
<luc.vanoostenryck@xxxxxxxxx> wrote:
>
> But since the current multi-instructions simplifications need anyway
> to be kept as they're also useful for non-bitfields, it would just add
> more work and more combinations and more code with very few in return
> (less instructions and pseudos at linearization time, faster
> simplification of bitfields).

Exactly. And you often have combinations of shifts _and_ the bitfield
insert/extract cases, so it really explodes.

So having insert/extract instructions might simplify the simple cases,
but it would make the complex cases even worse.

          Linus



[Index of Archives]     [Newbies FAQ]     [LKML]     [IETF Annouce]     [DCCP]     [Netdev]     [Networking]     [Security]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Linux SCSI]     [Trinity Fuzzer Tool]

  Powered by Linux