https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #13 from Vladimir Makarov ---
(In reply to Tamar Christina from comment #12)
> (In reply to Vladimir Makarov from comment #11)
> > I just expressed my point of view to the bottom-up approach. If somebody
> > implements any new RA a
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #12 from Tamar Christina ---
(In reply to Vladimir Makarov from comment #11)
> (In reply to Tamar Christina from comment #10)
> > Hi Vlad,
> >
> > Just curious if you had a chance to think about an approach to this that
> > would be
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #11 from Vladimir Makarov ---
(In reply to Tamar Christina from comment #10)
> Hi Vlad,
>
> Just curious if you had a chance to think about an approach to this that
> would be acceptable.
Sorry for not working on this issue more a
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
Tamar Christina changed:
What|Removed |Added
CC||tnfchris at gcc dot gnu.org
--- Commen
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #9 from Feng Xue ---
(In reply to Feng Xue from comment #5)
> > I would say that top-down algorithm behaves better than bottom-up one. I
> > implemented Callahan-Koblentz (bottom-up algorithm) in GCC about 10 years
> > ago and it b
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #8 from Feng Xue ---
Created attachment 46294
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=46294&action=edit
asm file 2 generated by llvm
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #7 from Feng Xue ---
Created attachment 46293
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=46293&action=edit
asm file 2 generated by gcc
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #6 from Feng Xue ---
Created attachment 46292
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=46292&action=edit
test case with less live ranges
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #5 from Feng Xue ---
> I would say that top-down algorithm behaves better than bottom-up one. I
> implemented Callahan-Koblentz (bottom-up algorithm) in GCC about 10 years
> ago and it behaved worse than the current one. I think a
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #4 from Vladimir Makarov ---
(In reply to Feng Xue from comment #0)
> Current regional RA uses a top-down allocation order, which may not properly
> split a long live range that crosses sub-region with high register pressure.
>
> In
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #3 from Feng Xue ---
Created attachment 46237
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=46237&action=edit
test case for aarch64
Add another case composed for aarch64.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #2 from Feng Xue ---
Created attachment 46219
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=46219&action=edit
asm file generated by llvm
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90174
--- Comment #1 from Feng Xue ---
Created attachment 46218
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=46218&action=edit
asm file generated by gcc
13 matches
Mail list logo
