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/55393] gcc/g++ multiplies two unsigned integers using the IMULQ instruction


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55393

Jakub Jelinek <jakub at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |jakub at gcc dot gnu.org

--- Comment #1 from Jakub Jelinek <jakub at gcc dot gnu.org> 2012-11-19 14:02:38 UTC ---
999999999999999999UL is 0xde0b6b3a763ffffUL, that definitely doesn't have bit
63 set, and that times 1024UL is 0x82dace9d8ffffc00UL which is bigger than
0xde0b6b3a763ffffUL, so can you shed some light why you think it should print
overflow?  I don't see any bug in the generated code, only in your assumptions.


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