https://gcc.gnu.org/bugzilla/show_bug.cgi?id=94026
Wilco changed:
What|Removed |Added
CC||wdijkstr at arm dot com
--- Comment #5 from
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=94026
--- Comment #4 from Fei Yang ---
(In reply to Fei Yang from comment #0)
> Created attachment 47966 [details]
> proposed patch to fix this issue
>
> Simple test case:
> int
> foo (int c, int d)
> {
> int a = (c >> d) & 7;
>
> if (a >= 2) {
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=94026
--- Comment #3 from Andrew Pinski ---
I think part of this optimization should be done on the tree level.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=94026
--- Comment #2 from Fei Yang ---
The test case is reduced from spec2017 benchmark.
int FastBoard::count_pliberties(const int i) {
return count_neighbours(EMPTY, i);
}
// count neighbours of color c at vertex v
int
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=94026
Richard Biener changed:
What|Removed |Added
Keywords||missed-optimization
--- Comment #1
