This is the mail archive of the gcc-bugs@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

[Bug rtl-optimization/63259] Detecting byteswap sequence


https://gcc.gnu.org/bugzilla/show_bug.cgi?id=63259

thopre01 at gcc dot gnu.org changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
             Status|NEW                         |ASSIGNED

--- Comment #3 from thopre01 at gcc dot gnu.org ---
The reason is that the last gimple statement of this bswap is a rotation right
on the result of a bitwise OR. Right now bswap are searched only from bitwise
OR statement doing recursion until the source. Therefore the analysis is only
done on a subset of the statements making up this bswap.

The fix is easy but needs compilation benchmarking to make sure this doesn't
increase the cost of compiling in a noticeable way. The more statement are
considered as finishing a bswap, the closer we are to a O(nÂ) algorithm.

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]