https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
Andrew Pinski changed:
What|Removed |Added
Severity|normal |enhancement
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #12 from Jiangning Liu
---
MGO RFC is at https://gcc.gnu.org/pipermail/gcc/2021-January/234682.html
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #11 from Jiangning Liu
---
(In reply to rguent...@suse.de from comment #8)
> On Sat, 9 Jan 2021, jiangning.liu at amperecomputing dot com wrote:
>
> > https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
> >
> > --- Comment #7 from J
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #10 from Jiangning Liu
---
(In reply to Hongtao.liu from comment #9)
> It looks like a SOA/AOC opt opportunity which is discussed in
> https://gcc.gnu.org/wiki/
> cauldron2015?action=AttachFile&do=view&target=Olga+Golovanevsky_+Memor
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
Hongtao.liu changed:
What|Removed |Added
CC||crazylht at gmail dot com
--- Comment #9 f
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #8 from rguenther at suse dot de ---
On Sat, 9 Jan 2021, jiangning.liu at amperecomputing dot com wrote:
> https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
>
> --- Comment #7 from Jiangning Liu
> ---
> (In reply to rguent...@sus
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #7 from Jiangning Liu ---
(In reply to rguent...@suse.de from comment #6)
> On January 9, 2021 4:17:17 AM GMT+01:00, "jiangning.liu at amperecomputing
> dot com" wrote:
> >https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
> >
> >---
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #6 from rguenther at suse dot de ---
On January 9, 2021 4:17:17 AM GMT+01:00, "jiangning.liu at amperecomputing dot
com" wrote:
>https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
>
>--- Comment #5 from Jiangning Liu com> ---
>> It h
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #5 from Jiangning Liu ---
> It has to be done with care of course, cost modeling is difficult
> (we need to have a good estimate of n and m or need to version
> the whole nest). That said, usually we attempt the reverse transform.
B
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #4 from bin cheng ---
Didn't go deep into the case.
For simple cases taken as examples, it's possible to interchange the two loops
thus enables loop invariant code motion. Though loop interchange may fail
because of complicated data
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #3 from rguenther at suse dot de ---
On Fri, 8 Jan 2021, jiangning.liu at amperecomputing dot com wrote:
> https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
>
> --- Comment #2 from Jiangning Liu
> ---
> Loop distribution can only
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
--- Comment #2 from Jiangning Liu ---
Loop distribution can only handle very simple case. If the inner loop has
complicated control flow and other memory accesses with loop-carried
dependence, it would be hard to handle it. For example,
int foo
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98598
Richard Biener changed:
What|Removed |Added
Version|tree-ssa|11.0
Status|UNCONFIRMED
13 matches
Mail list logo
