On 10/1/19 1:39 PM, Tamar Christina wrote:
The patterns work by looking at the sequence produced after GCC lowers complex numbers. As such they would match any normal operation that does the same computations.
Thanks - I didn't understand Ramana's comments during the GNU Tools Cauldron about this feature, but now I do.
Can't wait to put my (upcoming) ThunderX hardware to work on this (plus that I have to teach *a lot* of 30-year+ Fortran programmers that you do not have to lower COMPLEX arithmetic yourself, because the compiler will do this optimally for you ...).
Kind regards, -- Toon Moene - e-mail: t...@moene.org - phone: +31 346 214290 Saturnushof 14, 3738 XG Maartensdijk, The Netherlands At home: http://moene.org/~toon/; weather: http://moene.org/~hirlam/ Progress of GNU Fortran: http://gcc.gnu.org/wiki/GFortran#news
