https://gcc.gnu.org/bugzilla/show_bug.cgi?id=118505
--- Comment #8 from Dhruv Chawla <dhruvc at nvidia dot com> --- (In reply to Andrew Pinski from comment #7) > I do have to wonder if splitting the path here helps because the condition > (a[i] > 0.) Is predictable. > > I can't think it would be predictable but maybe on accident the predictor > get it right 50% of the time, we can keep the pipeline full. > > I have to think of a good heuristic for that too. I think you're right, looking at the initialization code in common.c:415 shows that "a" is always set to positive numbers, so I think only one path is ever taken.
