https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98986
rsandifo at gcc dot gnu.org <rsandifo at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |rsandifo at gcc dot gnu.org
--- Comment #3 from rsandifo at gcc dot gnu.org <rsandifo at gcc dot gnu.org>
---
Yeah, I think making the canonicalisation rules go deep into
the operands has scalability problems.
FWIW, another similar thing I've wanted in the past is to try
recognising multiple possible constants in an (and X (const_int N))
when X is known to have some bits clear. Often we try to make N contain
as few bits as possible, but that can give worse results than a fuller mask.
I had a WIP patch for this and binary order thing. It used a wrapper
around recog (in recog.c) to apply useful-looking variations.
Of course, trying multiple variations has scalability issues too,
so it would need some kind of limiter.
