On Wed, 16 Jun 2021, Martin Jambor wrote:
> Hi,
>
> On Wed, Jun 16 2021, Jakub Jelinek wrote:
> > On Tue, Jun 15, 2021 at 06:11:27PM +0200, Richard Biener wrote:
> >> >--- a/gcc/tree-sra.c
> >> >+++ b/gcc/tree-sra.c
> >> >@@ -915,6 +915,12 @@ create_access (tree expr, gimple *stmt, bool
> >>
Hi,
On Wed, Jun 16 2021, Jakub Jelinek wrote:
> On Tue, Jun 15, 2021 at 06:11:27PM +0200, Richard Biener wrote:
>> >--- a/gcc/tree-sra.c
>> >+++ b/gcc/tree-sra.c
>> >@@ -915,6 +915,12 @@ create_access (tree expr, gimple *stmt, bool
>> >write)
>> >if (!DECL_P (base) || !bitmap_bit_p
On 6/16/21 5:48 AM, Jakub Jelinek wrote:
On Tue, Jun 15, 2021 at 06:11:27PM +0200, Richard Biener wrote:
--- a/gcc/tree-sra.c
+++ b/gcc/tree-sra.c
@@ -915,6 +915,12 @@ create_access (tree expr, gimple *stmt, bool
write)
if (!DECL_P (base) || !bitmap_bit_p (candidate_bitmap, DECL_UID
(base)))
On 6/16/2021 4:00 AM, Richard Biener wrote:
On Wed, 16 Jun 2021, Martin Jambor wrote:
Hi Richi,
On Tue, Jun 15 2021, Richard Biener wrote:
On June 15, 2021 5:09:40 PM GMT+02:00, Martin Jambor wrote:
Hi,
When SRA transforms an assignment where the RHS is an aggregate decl
that it
On Tue, Jun 15, 2021 at 06:11:27PM +0200, Richard Biener wrote:
> >--- a/gcc/tree-sra.c
> >+++ b/gcc/tree-sra.c
> >@@ -915,6 +915,12 @@ create_access (tree expr, gimple *stmt, bool
> >write)
> >if (!DECL_P (base) || !bitmap_bit_p (candidate_bitmap, DECL_UID
> >(base)))
> > return NULL;
> >
>
On Wed, 16 Jun 2021, Martin Jambor wrote:
> Hi Richi,
>
> On Tue, Jun 15 2021, Richard Biener wrote:
> > On June 15, 2021 5:09:40 PM GMT+02:00, Martin Jambor
> > wrote:
> >>Hi,
> >>
> >>When SRA transforms an assignment where the RHS is an aggregate decl
> >>that it creates replacements for,
Hi Richi,
On Tue, Jun 15 2021, Richard Biener wrote:
> On June 15, 2021 5:09:40 PM GMT+02:00, Martin Jambor wrote:
>>Hi,
>>
>>When SRA transforms an assignment where the RHS is an aggregate decl
>>that it creates replacements for, the (least efficient) fallback method
>>of dealing with them is
On June 15, 2021 5:09:40 PM GMT+02:00, Martin Jambor wrote:
>Hi,
>
>When SRA transforms an assignment where the RHS is an aggregate decl
>that it creates replacements for, the (least efficient) fallback method
>of dealing with them is to store all the replacements back into the
>original decl and
Hi,
When SRA transforms an assignment where the RHS is an aggregate decl
that it creates replacements for, the (least efficient) fallback method
of dealing with them is to store all the replacements back into the
original decl and then let the original assignment takes its course.
That of course
