On 5 October 2017 at 21:40, Christophe Lyon wrote:
> Hi Jeff,
>
>
> On 7 September 2017 at 00:18, Jeff Law wrote:
>> Another old patch getting resurrected...
>>
>>
>
> This patch (r253305) introduces a new FAIL on arm-none-eabi (as
> opposed arm-linux-gnueabi*):
> FAIL: gcc.dg/tree-ssa/ssa-ds
Hi Jeff,
On 7 September 2017 at 00:18, Jeff Law wrote:
> Another old patch getting resurrected...
>
>
This patch (r253305) introduces a new FAIL on arm-none-eabi (as
opposed arm-linux-gnueabi*):
FAIL: gcc.dg/tree-ssa/ssa-dse-26.c scan-tree-dump-times dse1
"Deleted dead store" 2
I'm not fam
Jeff Law writes:
> @@ -468,6 +468,36 @@ maybe_trim_partially_dead_store (ao_ref *ref, sbitmap
> live, gimple *stmt)
> }
> }
>
> +/* Return TRUE if USE_REF reads bytes from LIVE where live is
> + derived from REF, a write reference.
> +
> + While this routine may modify USE_REF, it's p
Another old patch getting resurrected...
On 01/04/2017 06:50 AM, Richard Biener wrote:
> On Thu, Dec 22, 2016 at 7:26 AM, Jeff Law wrote:
>> This is the final patch in the kit to improve our DSE implementation.
>>
>> It's based on a observation by Richi. Namely that a read from bytes of
>> memo
On Thu, Dec 22, 2016 at 7:26 AM, Jeff Law wrote:
> This is the final patch in the kit to improve our DSE implementation.
>
> It's based on a observation by Richi. Namely that a read from bytes of
> memory that are dead can be ignored. By ignoring such reads we can
> sometimes find additional sto
This is the final patch in the kit to improve our DSE implementation.
It's based on a observation by Richi. Namely that a read from bytes of
memory that are dead can be ignored. By ignoring such reads we can
sometimes find additional stores that allow us to either eliminate or
trim an earlie
This is the final patch in the kit to improve our DSE implementation.
It's based on a observation by Richi. Namely that a read from bytes of
memory that are dead can be ignored. By ignoring such reads we can
sometimes find additional stores that allow us to either eliminate or
trim an earlie
