https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
--- Comment #9 from CVS Commits ---
The master branch has been updated by Martin Liska :
https://gcc.gnu.org/g:c517cf2e685e2903b591d63c1034ff9726cb3822
commit r12-2928-gc517cf2e685e2903b591d63c1034ff9726cb3822
Author: Martin Liska
Date:
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
--- Comment #8 from Martin Liška ---
(In reply to Richard Biener from comment #4)
> I guess that's already done, so it has to be fixed in other ways, like by
> keeping the partial sum when decreasing the size in
I can confirm the decreasing
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
--- Comment #7 from Martin Liška ---
> Now, there's the possibility of doing a quick guess before doing this
> loop, once via using (end - start) and once via using 2 * (end - start).
> Only if the first can be handled and the second not we
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
Richard Biener changed:
What|Removed |Added
Target Milestone|9.4 |9.5
--- Comment #6 from Richard
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
Martin Liška changed:
What|Removed |Added
Assignee|unassigned at gcc dot gnu.org |marxin at gcc dot
gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
--- Comment #4 from Richard Biener ---
I guess that's already done, so it has to be fixed in other ways, like by
keeping the partial sum when decreasing the size in
for (unsigned j = 0; j < i; j++)
{
if (min[j].m_count
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
--- Comment #3 from Richard Biener ---
Samples: 847K of event 'cycles:u', Event count (approx.): 839745061761
Overhead Samples Command Shared Object Symbol
95.05%804298 cc1 cc1
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100393
Richard Biener changed:
What|Removed |Added
Priority|P3 |P2
Last reconfirmed|
